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.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;

public class Main{

	public static void main(String args[]){
		new Main().mainrun();
	}

	private Scanner scan;

	private boolean[] state;
	private long[] sum;
	private List<Integer> onstate;

	private int N;
	private boolean flag;

	private void mainrun() {

		scan = new Scanner(System.in);

		state = new boolean[4001];
		sum = new long[4001];
		onstate = new ArrayList<Integer>();

		while(true){
			N = scan.nextInt();

			if(N == 0) {
				break;
			}
			Arrays.fill(sum,0);
			Arrays.fill(state,false);
			
			onstate.clear();
			
			flag = false;
			
			for(int i = 0;i < N;i++){
				looprun();
			}

			onstate.sort((e1,e2)->(e1 > e2 ? 1 : 0));

			for(Integer num : onstate) {
				if(sum[num] >= 1000000) {
					flag = true;
					System.out.println(num);
				}
			}
			if(!flag) {
				System.out.println("NA");
			}

			

		}


	}


	private void looprun() {
		int e = scan.nextInt();
		long p = scan.nextInt();
		long q = scan.nextInt();

		if(!state[e]) {
			state[e] = true;
			onstate.add(e);
		}

		sum[e] += p * q;
	}

}
