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>
class employee {
 public:
  long long int id;
  long long int p, q;
  bool more_than_million() { return (p * q >= 1000000); }
};
int n;
std::vector<employee> data;
void init() {
  n = 0;
  data.clear();
}
bool get_input() {
  init();
  std::cin >> n;
  if (n == 0) {
    return false;
  }
  for (int i = 0; i < n; i++) {
    employee tmp;
    std::cin >> tmp.id >> tmp.p >> tmp.q;
    data.push_back(tmp);
  }
  return true;
}
void solve() {
  std::vector<employee>::iterator i = data.begin();
  std::vector<long long int> top_salers;
  while (i != data.end()) {
    if ((*i).more_than_million()) {
      top_salers.push_back((*i).id);
    }
    i++;
  }
  if (top_salers.empty()) {
    std::cout << "NA" << std::endl;
  } else {
    for (std::vector<long long int>::iterator j = top_salers.begin();
         j != top_salers.end(); j++) {
      std::cout << (*j) << std::endl;
    }
  }
}
int main() {
  while (get_input()) {
    solve();
  }
  return 0;
}
