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>
struct KOUZOUTAI0100 {
  int no;
  int tanka;
  int kazu;
  long long int sum;
};
int linearSearch(struct KOUZOUTAI0100 array[], int n, int key);
int main() {
  int i;
  int n, m = 0;
  int count;
  int isExist;
  struct KOUZOUTAI0100 data[4000];
  struct KOUZOUTAI0100 temp;
  while (1) {
    scanf("%d", &n);
    if (n == 0) {
      break;
    }
    for (i = 0; i < m; i++) {
      data[i].no = 0;
      data[i].tanka = 0;
      data[i].kazu = 0;
      data[i].sum = 0;
    }
    m = 0;
    count = 0;
    for (i = 0; i < n; i++) {
      scanf("%d %d %d", &temp.no, &temp.tanka, &temp.kazu);
      isExist = linearSearch(data, m, temp.no);
      if (isExist != -1) {
        data[isExist].tanka += temp.tanka;
        data[isExist].kazu += temp.kazu;
        data[isExist].sum += data[isExist].tanka * data[isExist].kazu;
      } else {
        data[m] = temp;
        data[m].sum += data[m].tanka * data[m].kazu;
        m++;
      }
    }
    for (i = 0; i < m; i++) {
      if (data[i].sum >= 1000000) {
        printf("%d\n", data[i].no);
        count++;
      }
    }
    if (count == 0) {
      printf("NA\n");
    }
  }
  return 0;
}
int linearSearch(struct KOUZOUTAI0100 array[], int n, int key) {
  int i;
  int ret = -1;
  for (i = 0; i < n; i++) {
    if (array[i].no == key) {
      ret = i;
      break;
    }
  }
  return ret;
}
