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 setsize;
  int i;
  int num;
  long tanka, suuryo;
  long uriage[4001][2];
  int order[4001];
  int count;
  int na_flag;
  for (i = 1; i < 4001; i++) {
    uriage[i][0] = 0;
    uriage[i][1] = 0;
  }
  while (1) {
    scanf("%d", &setsize);
    if (setsize == 0) break;
    count = 0;
    na_flag = 1;
    for (i = 0; i < setsize; i++) {
      scanf("%d %ld %ld", &num, &tanka, &suuryo);
      if (uriage[num][0] == 0) {
        order[count] = num;
        count++;
      }
      uriage[num][0] += tanka * suuryo;
      if (uriage[num][0] >= 1000000) uriage[num][1] = 1;
    }
    for (i = 0; i < count; i++) {
      num = order[i];
      if (uriage[num][1] == 1) {
        printf("%d\n", num);
        na_flag = 0;
      }
      uriage[num][0] = 0;
      uriage[num][1] = 0;
    }
    if (na_flag) printf("NA\n");
  }
  return 0;
}
