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;
int main() {
  int id, price, num, count, SaleResult[4000], idOrder[4000], orderCount = 1;
  bool isBe = false;
  while (true) {
    cin >> count;
    if (count == 0) {
      break;
    }
    for (int i = 0; i < count; i++) {
      cin >> id >> price >> num;
      SaleResult[id] += price * num;
      if (SaleResult[id] >= 1000000) {
        for (int i = 0; i < orderCount; i++) {
          if (id == idOrder[i]) {
            break;
          }
          if (i == orderCount - 1) {
            idOrder[orderCount] = id;
          }
        }
      }
    }
    for (int i = 0; i < 4000; i++) {
      if (SaleResult[idOrder[i]] >= 1000000) {
        cout << i << '\n';
        isBe = true;
      }
    }
    if (!isBe) {
      cout << "NA\n";
    }
    count = 0;
    isBe = false;
    for (int i = 0; i < 4000; i++) {
      SaleResult[i] = 0;
    }
  }
  return 0;
}
