Problem:
Sale Result

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"

Sample 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 for the Sample Input

1001
1003
NA
2013

Solution in C (judge verdict: Time Limit Exceeded)

#include <stdio.h>

int main(void)
{
	int i,j,count;
	int data,number[4000],tanka[4000],kosu[4000];
	long long int uriage[4000];
	
	
	while(1)
	{
		for(i=0;i<4000;i++)	//初期
			uriage[i]=0;
		count=0;
		
		scanf("%d",&data);
		if(data!=0)
		{
			for(i=0;i<data;i++)
			{
				scanf("%d %d %d",&number[i],&tanka[i],&kosu[i]);
				uriage[i]+=(tanka[i]*kosu[i]);
				for(j=0;j<i;j++)	//既に同じIDがあるか
				{
					if(number[i]==number[j])	//あったら上にあるものに足して下にあるものを消す
					{
						uriage[j]+=uriage[i];
						uriage[i]=0;
					}
				}
			}
		
		for(i=0;i<data;i++)
		{
			if(uriage[i]>=1000000)
			{
				printf("%d\n",number[i]);
				count++;
			}
		}
		if(count==0)
			printf("NA\n");
		
		}
	}
	return 0;
}