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>
typedef struct syaing {
  int bango[100000];
  int ne[100000];
  int kazu[100000];
} deta;
int main() {
  deta f;
  int a, i, check[100000], lek, kof[100000], nl = 0;
  while (1) {
    memset(check, 0, sizeof(int) * 100000);
    memset(f.bango, 0, sizeof(int) * 100000);
    memset(f.kazu, 0, sizeof(int) * 100000);
    memset(f.ne, 0, sizeof(int) * 100000);
    lek = 0;
    scanf("%d", &a);
    if (a == 0) break;
    for (i = 0; i < a; i++) {
      scanf("%d%d%d", &f.bango[i], &f.kazu[i], &f.ne[i]);
      if (f.kazu[i] * f.ne[i] >= 1000000) check[i] = f.bango[i];
    }
    for (i = 0; i < a; i++) {
      if (check[i] != 0) {
        lek++;
        kof[nl] = check[i];
        nl++;
      }
    }
    if (lek == 0) {
      kof[nl] = 0;
      nl++;
    }
  }
  for (i = 0; i < nl; i++) {
    if (kof[i] == 0)
      printf("NA\n");
    else
      printf("%d\n", kof[i]);
  }
  return 0;
}
