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<stdio.h>
long long int t[4000];
int k[4000];
bool sub[4000];
int main(){
	int a;
	while(scanf("%d",&a),a){
		for(int i=0;i<4000;i++){
			t[i]=0;
			k[i]=0;
			sub[i]=false;
		}
		int o=0;
		for(int i=0;i<a;i++){
			int b,c,d;
			
			scanf("%d%d%d",&b,&c,&d);
			t[b-1]+=(long long)c*(long long)d;
			if(!sub[b-1]){
				k[o++]=b-1;
				sub[b-1]=true;
			}
		}
		bool ok=false;
		for(int i=0;i<o;i++){
			if(t[k[i]]>=1000000LL){
				printf("%d\n",k[i]+1);
				ok=true;
			}
		}
		if(!ok)printf("NA\n");
	}
}