Problem: 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

Solution (in CPP):

Solution:
#include <iostream>
#define FOR(i,a,b) for(int i=(a); i<(b);i++)
#define REP(i,n) FOR(i,0,n)
using namespace std;
typedef long long ll;

int main(){
  int n;//入力するデータ
  int check;
  while(cin >> n){
    if(n==0) break;
    check=0;
    ll num[4001]={0};//社員の売り上げ金額
    bool bl[4001]={false};
    ll t[4001]={0};//社員番号
    ll emp,cost,count;
    int k=0;
    REP(i,n){
      cin >> emp >> cost >> count;
      if(bl[emp]==false){
        bl[emp]=true;
        t[k++]=emp;
        num[emp] = cost*count;
      }
      else{
      num[emp] += cost * count;
      }
    }
    REP(i,n){
      if(num[t[i]] >= 1000000){
        cout << t[i] << endl;
        check++;
  }
    }
    if(check==0)
      cout << "NA" << endl;
  }
}