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;
template <typename _Ty>
std::ostream& operator<<(std::ostream& ostr, const std::vector<_Ty> v) {
  if (v.empty()) return ostr;
  for (auto itr = v.begin(); itr != v.end(); itr++) {
    if (itr == v.begin()) {
      std::cout << "{" << *itr;
    } else
      std::cout << ", " << *itr;
  }
  std::cout << "}";
  return ostr;
}
class Point2i {
 public:
  int x;
  int y;
  Point2i() {
    this->x = x;
    this->y = y;
  }
  Point2i(int x, int y) {
    this->x = x;
    this->y = y;
  }
  friend std::ostream& operator<<(std::ostream& ostr, const Point2i& p) {
    std::cout << "{" << p.x << ", " << p.y << "}";
    return ostr;
  }
};
bool AOJ0100() {
  long long int n, e, p, q;
  cin >> n;
  if (n == 0) return false;
  long long int* data = new long long int[4001];
  for (int i = 0; i <= 4000; i++) data[i] = 0;
  for (long long int i = 0; i < n; i++) {
    cin >> e >> p >> q;
    data[e] += p * q;
  }
  bool flag = false;
  for (int i = 1; i <= 4000; i++) {
    if (data[i] >= 1000000) {
      flag = true;
      cout << i << endl;
    }
  }
  if (!flag) cout << "NA" << endl;
  delete[] data;
  return true;
}
int main() {
  while (AOJ0100()) {
  }
  return 0;
}
