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 JAVA (judge verdict: Wrong Answer)

import java.util.Scanner;

public class Main{
	public static void main(String[] args){
		Scanner stdIn = new Scanner(System.in);
		int n = stdIn.nextInt();
		
		int index = 0;
		int[][] employee = new int[1000][4001];
		int[][] result = new int[1000][4001];
		
		while( n != 0 ){
			int count = 1;
			int[] check = new int[4001];
			for(int i = 0; i < n; i++){
				int id = stdIn.nextInt();
				long p = stdIn.nextLong();
				long q = stdIn.nextLong();
				if( check[id] == 0 ){
					check[id] = count;
					employee[index][count] = id;
					count++;
				} 
				result[index][check[id]] += p*q;
			}
			n = stdIn.nextInt();
			index++;
		}
		
		for(int i = 0; i < index; i++){
			boolean flag = false;
			for(int j = 1; j < 4001; j++){
				if( employee[i][j] == 0 ){
					if( !flag ){
						System.out.println("NA");
					}
					break;
				} else if( result[i][j] >= 1000000 ){
						System.out.println(employee[i][j]);
						flag = true;
				}
			}
		}
	}
}