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>
int main() {
  int n;
  std::pair<int, int> v[4001];
  bool used[4001];
  while (1) {
    std::cin >> n;
    if (!n) break;
    memset(v, 0, sizeof(v));
    memset(used, false, sizeof(used));
    while (n--) {
      int num;
      int a, b;
      std::cin >> num >> a >> b;
      if (!used[num]) {
        v[num] = std::pair<int, int>(a, b);
        used[num] = true;
      } else {
        v[num].first += a;
        v[num].second += b;
      }
    }
    for (int i = 0; i < 4001; i++) {
      if (v[i].first == 0 && v[i].second == 0) continue;
      long long p = v[i].first * v[i].second;
      if (p < 1000000) {
        v[i].first = v[i].second = 0;
      }
    }
    if (std::count(v, v + 4001, std::pair<int, int>(0, 0)) == 4001) {
      std::cout << "NA" << std::endl;
    } else {
      for (int i = 1; i < 4001; i++) {
        if (v[i].first && v[i].second) std::cout << i << std::endl;
      }
    }
  }
  return 0;
}
