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>
void set_zero(int v[]) {
  int i;
  for (i = 0; i < 4001; i++) {
    v[i] = 0;
  }
}
void set_zero_zero(long long int v[]) {
  int i;
  for (i = 0; i < 4001; i++) {
    v[i] = 0;
  }
}
int main(void) {
  int n;
  int number[4001];
  int price[4001];
  int kosu[4001];
  int harasyo[4001];
  long long int sum[4001];
  int i, j;
  int flag = 0;
  while (scanf("%d", &n)) {
    set_zero(harasyo);
    set_zero_zero(sum);
    flag = 0;
    if (n == 0) {
      break;
    }
    for (i = 0; i < n; i++) {
      scanf("%d %d %d", &number[i], &price[i], &kosu[i]);
      sum[i] = price[i] * kosu[i];
    }
    flag = 0;
    for (i = 0; i < n; i++) {
      for (j = 1; j < n; j++) {
        if (number[i] == number[i + j]) {
          sum[i] += sum[i + j];
        }
      }
    }
    flag = 0;
    for (i = 0; i < n; i++) {
      if (sum[i] >= 1000000) {
        harasyo[i] = number[i];
        flag = 1;
      }
    }
    if (flag == 0) {
      printf("NA\n");
    }
    for (i = 0; i <= 4000; i++) {
      if (harasyo[i] != 0) {
        printf("%d\n", harasyo[i]);
      }
      flag = 0;
    }
  }
  return 0;
}
