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 {
  int num;
  long long sale;
  int cnum;
} data;
int min(int a, int b) {
  if (a <= b)
    return a;
  else
    return b;
}
int comp(const void* a, const void* b) {
  data* p = (data*)a;
  data* q = (data*)b;
  return p->num - q->num;
}
int main() {
  int n, i;
  data d[4000];
  int cost, nu, k;
  int c;
  while (1) {
    scanf("%d", &n);
    if (n == 0) return 0;
    c = 0;
    for (i = 0; i < 4000; i++) {
      d[i].num = 4000;
      d[i].sale = 0;
      d[i].cnum = 0;
    }
    for (i = 0; i < n; i++) {
      scanf("%d %d %d", &nu, &cost, &k);
      d[nu - 1].cnum = nu - 1;
      d[nu - 1].num = min(d[nu - 1].num, c++);
      d[nu - 1].sale += cost * k;
    }
    qsort(d, 4000, sizeof(data), comp);
    bool f = false;
    for (i = 0; i < c; i++) {
      if (d[i].sale >= 1000000) {
        printf("%d\n", d[i].cnum + 1);
        f = true;
      }
      if (d[i].num == 4000) break;
    }
    if (!f) printf("NA\n");
  }
}
