There is data on sales of your company. Your task is to write a program which identifies good workers.

The program should read a list of data where each item includes the employee ID i, the amount of sales q and the corresponding unit price p. Then, the program should print IDs of employees whose total sales proceeds (i.e. sum of p × q) is greater than or equal to 1,000,000 in the order of inputting. If there is no such employees, the program should print "NA". You can suppose that n < 4000, and each employee has an unique ID. The unit price p is less than or equal to 1,000,000 and the amount of sales q is less than or equal to 100,000.



Input

The input consists of several datasets. The input ends with a line including a single 0. Each dataset consists of:


n (the number of data in the list)
i p q
i p q
:
:
i p q


Output

For each dataset, print a list of employee IDs or a text "NA"

Example

Input

4
1001 2000 520
1002 1800 450
1003 1600 625
1001 200 1220
2
1001 100 3
1005 1000 100
2
2013 5000 100
2013 5000 100
0


Output

1001
1003
NA
2013
#include <bits/stdc++.h>
using namespace std;
class Input {
 public:
  long long n;
  vector<long long> numbers, tanka, num;
  bool input() {
    scanf("%d", &n);
    if (!n) {
      return false;
    }
    for (long long i = 0; i < n; i++) {
      long long s, t, u;
      scanf("%d%d%d", &s, &t, &u);
      numbers.push_back(s);
      tanka.push_back(t);
      num.push_back(u);
    }
    return true;
  }
};
class Solver : public Input {
 public:
  vector<long long> solve() {
    map<long long, long long> data;
    for (long long i = 0; i < n; i++) {
      long long value = tanka[i] * num[i];
      long long number = numbers[i];
      if (data.find(number) == data.end()) {
        data[number] = 0;
      }
      data[number] += value;
    }
    vector<long long> ret;
    for (map<long long, long long>::iterator it = data.begin();
         it != data.end(); it++) {
      if ((*it).second >= 1000000) {
        ret.push_back((*it).first);
      }
    }
    return ret;
  }
};
signed main() {
  while (true) {
    Solver solver;
    if (!solver.input()) {
      break;
    }
    vector<long long> res = solver.solve();
    if (res.size() == 0) {
      cout << "NA" << endl;
    } else {
      for (long long i = 0; i < res.size(); i++) {
        cout << res[i] << endl;
      }
    }
  }
  return 0;
}
