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>
using namespace std;
typedef struct {
  int sum;
  int pr;
} data;
int main(int argc, char **argv) {
  int i, p, q, n, size = 0, flag, pri = 1, max;
  data *sarray = (data *)calloc(4000, sizeof(data));
  int *id = (int *)calloc(1000, sizeof(int));
  while (1) {
    cin >> n;
    if (n == 0) {
      cout << "NA" << endl;
      break;
    }
    while (n > 0) {
      n--;
      cin >> i >> p >> q;
      flag = 0;
      for (int j = 0; j < size; j++) {
        if (id[j] == i) {
          if (p * q > sarray[i].sum || pri != sarray[i].pr) {
            sarray[i].sum = p * q;
            sarray[i].pr = pri;
          }
          flag = 1;
          break;
        }
      }
      if (flag == 0) {
        id[size] = i;
        sarray[i].sum = p * q;
        sarray[i].pr = pri;
        size++;
      }
    }
    max = id[0];
    for (int j = 1; j < size; j++) {
      if (sarray[max].sum < sarray[id[j]].sum) {
        max = id[j];
      }
    }
    cout << max << endl;
    pri++;
  }
  free(sarray);
  return 0;
}
