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: Accepted)

#include<stdio.h>
#define max 4000
#define score 1000000

long long int id[max],raw[max];

int main(){
  long long int num,sale,deal;
  long long int n,i,j,count,k,l,m;
  
  while(1)
    {
      scanf("%lld",&n);

      for (k=0;k<=max;k++)
      {
	id[k] = 0;
      }

      if(n==0)
	{
	  break;
	}

      else
	{
	  count = 0;
	  for(i=1;i<=n;i++)
	{
	  scanf("%lld %lld %lld",&num,&sale,&deal);
	  id[num] = id[num] + (sale * deal);
	  raw[i] = num;
	}
	  for(l=0;l<max;l++)
	    {
		  for(m=l+1;m<=max;m++)
		    {
		      if(raw[l]==raw[m])
			{
			  raw[m]=0;
			}
		    }
	    }
	  for(j=1;j < max;j++)
	{
       	  if(id[raw[j]] >=  score)
	  {
	      printf("%lld\n",raw[j]);
	      count++;
	  }
	}
	  if(count==0)
	    {
	 printf("NA\n");
	    }
	  
	}
    }
  return 0;
}