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;
  int n, m, p;
  int P[4001][3] = {};
  int PT[4001][3] = {};
  while (1) {
    scanf("%d", &N);
    if (N == 0) break;
    for (int i = 1; i <= N; i++) {
      scanf("%d %d %d", &n, &m, &p);
      P[n][0] += m * p;
      if (P[n][1] == 0) P[n][1] = i;
    }
    int c = 0;
    for (int i = 0; i < 4000; i++)
      if (1000000 <= P[i][0]) {
        PT[c][0] = P[i][0];
        PT[c][1] = P[i][1];
        c++;
      }
    for (int i = 0; i < c; i++)
      for (int j = c - 1; j > i; j--)
        if (PT[j][1] < PT[j - 1][1]) {
          int TT = PT[j][1];
          PT[j][1] = PT[j - 1][1];
          PT[j - 1][1] = TT;
        }
    for (int i = 0; i < c; i++) printf("%d\n", PT[i][1]);
  }
  return 0;
}
