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(void) {
  int i, j, c, num, data;
  int staff[4000], n, value;
  int state[4000], state_n;
  char buf[10];
  while (1) {
    num = j = 0;
    while ((c = getchar()) != '\n') {
      buf[j++] = c;
      if (j == 1 && c == '0') break;
    }
    buf[j] = '\0';
    num = atoi(buf);
    if (num == 0) break;
    for (i = 0; i < 4000; i++) {
      staff[i] = 0;
      state[i] = 0;
    }
    state_n = 0;
    for (i = 0; i < num; i++) {
      data = j = 0;
      while ((c = getchar()) != '\n') {
        buf[j] = c;
        n = 0;
        value = 0;
        if (c == ' ' && data == 0) {
          buf[j] = '\0';
          n = atoi(buf);
          j = 0;
          data++;
          continue;
        }
        if (c == ' ' && data == 1) {
          buf[j] = '\0';
          value = atoi(buf);
          j = 0;
          data++;
          continue;
        }
        j++;
      }
      buf[j] = '\0';
      staff[n - 1] += atoi(buf) * value;
      if (staff[n - 1] >= 1000000 && state[n - 1] == 0) {
        state[n - 1] = ++state_n;
      }
    }
    if (state_n == 0) {
      printf("NA\n");
    }
    for (j = 1; j <= state_n; j++) {
      for (i = 0; i < 4000; i++) {
        if (state[i] == j) {
          printf("%d\n", i + 1);
        }
      }
    }
  }
  return 0;
}
