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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {

	public static void main(String[] args) throws NumberFormatException, IOException {
		// TODO ?????????????????????????????????????????????
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		while(true){
			int n = Integer.parseInt(br.readLine());

			if(n == 0) break;

			int[][] data = new int[1000][4];
			//?????????????????????
			for(int i = 0; i < data.length ; i++){
				for(int j = 0; j < data[i].length; j++){
					data[i][j] = 0;
				}
			}

			//?????????????????????
			for(int i = 0; i < n ; i++){
				String[] tmpArray = br.readLine().split(" ");

				//int ID = Integer.parseInt(tmpArray[0]);
				for(int j = 0; j < 3; j++){

					data[i][j] = Integer.parseInt(tmpArray[j]);
				}
			}

			//?????????????¨?
			int[] result = new int[4001];

			for(int i = 0; i < result.length ; i++){
				result[i] = 0;
			}

			for(int i = 0; i < n; i++){
				int remain = 1000000 - result[data[i][0]];

				if(remain <= 0){
					continue;
				}

				int require = remain / data[i][1];

				if(data[i][2] > require){
					result[data[i][0]] = 1000000;
				}
				else{
					result[data[i][0]] += data[i][1]*data[i][2];
				}
			}

			//????????????
			int count = 0;
			for(int i = 1; i < result.length; i++){
				if(result[i] >= 1000000){
					System.out.println(i);
					count++;
				}
			}

			if(count == 0){
				System.out.println("NA");
			}
		}
	}

}