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 kazu;
  long long data[4000][4];
  int kaunto[4000][2];
  int counto;
  int i, j;
  int number = 0;
  for (i = 0; i < 4000; i++) {
    data[i][0] = i + 1;
    kaunto[i][0] = i + 1;
  }
  for (i = 0; i < 4000; i++) {
    for (j = 1; j < 4; j++) {
      data[i][j] = 0;
    }
  }
  for (i = 0; i < 4000; i++) {
    kaunto[i][1] = 0;
  }
  scanf("%d", &kazu);
  while (kazu != 0) {
    counto = 0;
    for (i = 0; i < kazu; i++) {
      scanf("%d", &number);
      scanf("%d %d", &data[number - 1][1], &data[number - 1][2]);
      data[number - 1][3] += data[number - 1][1] * data[number - 1][2];
    }
    for (i = 0; i < 4000; i++) {
      if (data[i][3] >= 1000000 && kaunto[i][1] == 0) {
        printf("%d\n", kaunto[i][0]);
        kaunto[i][1] = 1;
        counto = 1;
      }
    }
    if (counto == 0) {
      printf("NA\n");
    }
    scanf("%d", &kazu);
  }
  return 0;
}
