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
import java.util.*;
public class Main {
	public static void main(String[] args) {
		Scanner stdIn = new Scanner(System.in);
		ArrayList<Data> list;
		while(true) {
			list = new ArrayList<Data>(5000);
			for(int i = 0; i < 5000; i++) {
				list.add(new Data(i+1,0,-1));
			}
			int n = stdIn.nextInt();
			if(n == 0) {
				break;
			}
			int count = 0;
			for(int i = 0; i < n; i++) {
				int id = stdIn.nextInt();
				int v = stdIn.nextInt();
				int s = stdIn.nextInt();
				if(list.get(id).number == -1) {
					list.set(id,new Data(id,v*s,count++));
				}
				else {
					Data k = list.get(id);
					k.addValue(v*s);
					list.set(id, k);
				}
			}
			Collections.sort(list,new MyComparator());
			boolean al = false;
			for(int i = 0; i < list.size(); i++) {
				Data tmp = list.get(i);
				if(tmp.number == -1) {
					break;
				}
				if(tmp.value < 1000000) {
					if(!al) {
						System.out.println("NA");
					}
					break;
				}
				else {
					al = true;
					System.out.println(tmp.id);
				}
			}
		}
	}
	
}

class Data {
	public int id;
	public int value;
	public int number;
	Data(int i, int v, int n) {
		id = i;
		value = v;
		number = n;
	}
	public void addValue(int v) {
		value += v;
	}

	
}

class MyComparator implements Comparator<Data> {

	public int compare(Data o1, Data o2) {
		if(o1.value < o2.value) {
			return 1;
		}
		else if(o1.value > o2.value) {
			return -1;
		}
		else if(o1.number < o2.number) {
			return -1;
		}
		else if(o1.number > o2.number) {
			return 1;
		}
		return 0;
	}
	
}
 