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;
int main() {
  int n, num, flag = 0, flag2 = 0;
  long long tanka, sell;
  while (cin >> n, n != 0) {
    flag = 0;
    flag2 = 0;
    vector<int> nu;
    vector<int> vi;
    vector<pair<int, long long> > pii;
    for (int i = 0; i < n; i++) {
      cin >> num >> tanka >> sell;
      for (int j = 0; j < vi.size(); j++) {
        if (num == vi[j]) {
          flag2 = 1;
          break;
        }
      }
      if (flag2 == 0) {
        flag = 0;
        for (int j = 0; j < pii.size(); j++) {
          if (pii[j].first == num) {
            flag = 1;
            pii.push_back(make_pair(num, ((tanka * sell) + pii[j].second)));
            if (((tanka * sell) + pii[j].second) >= 1000000) vi.push_back(num);
            break;
          }
        }
        if (flag == 0) {
          nu.push_back(num);
          pii.push_back(make_pair(num, tanka * sell));
          if ((tanka * sell) >= 1000000) vi.push_back(num);
        }
      }
    }
    if (vi.empty())
      cout << "NA" << endl;
    else {
      for (int k = 0; k < nu.size(); k++) {
        for (int l = 0; l < vi.size(); l++) {
          if (nu[k] == vi[l]) cout << nu[k] << endl;
        }
      }
    }
  }
  return 0;
}
