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 <cstdio>
#include <iostream>
#include <string>
using namespace std;

struct data{
  int a;
  long long total;
};

int main(){
  int i,j,n,c,a,yen,ko,f,f2;
  data d[4000];
  while(1){
    cin >> n;
    if(n == 0) break;
    c = 0;
    for(i=0;i<n;i++){
      cin >> a >> yen >> ko;
      f = 1;
      for(j=0;j<c;j++){
	if(a == d[j].a){
	  d[j].total += (long long) yen * ko;
	  f = 0;
	  break;
	}
      }
      if(f){
	d[c].a = a;
	d[c].total = (long long)yen * ko;
	c++;
      }
    }

    f2 = 1;
    for(i=0;i<c;i++){
      if(d[i].total >= 1000000){
	cout << d[i].a << endl;
	f2 = 0;
      }
    }
    if(f2) cout << "NA" << endl;

  }
  return 0;
}