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

Solution:
import java.math.BigInteger;
import java.util.Scanner;
import java.util.TreeSet;

public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner cin = new Scanner(System.in);
		while(true){
			int N=cin.nextInt();
			if(N==0){
				break;
			}
			BigInteger[] a = new BigInteger[4001];
			for(int i = 0; i < a.length;i++){
				a[i]=new BigInteger("0");
			}
			long max=-1;
			TreeSet<Integer> t = new TreeSet<Integer>();
			int[] b = new int[4001];
			int count=0;
			for(int i = 0; i <N;i++){
				int sha = cin.nextInt();
				long tan = cin.nextInt();
				long suu = cin.nextInt();
				a[sha]=a[sha].add(new BigInteger(tan*suu +""));
				if(t.contains(sha)){
					
				}
				else{
					b[count++]=sha;
					t.add(sha);
				}
			}
			boolean f = false;
			for(int i = 0; i <count;i++){
				//System.out.println("   "+b[i]);
				if(a[b[i]].compareTo(new BigInteger("1000000"))>=0){
					System.out.println(b[i]);
					f=true;
				}
			}
			/*
			for(int i = 1;i<=4000;i++){
				if(a[i].compareTo(new BigInteger("1000000"))>=0){
					System.out.println(i);
					f=true;
				}
			}*/
			
			if(!f){
				System.out.println("NA");
			}
		}

	}

}