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

public class Main {
	static class Worker implements Comparable<Worker>{
		int id;
		long result;
		int number;

		Worker (int id, long result, int number) {
			this.id = id;
			this.result = result;
			this.number = number;
		}

		public int compareTo(Worker x) {
			return this.number - x.number;
		}
	}

	public static void main (String args[]) {
		Scanner sc = new Scanner(System.in);
		Worker worker[];
		int n;
		int index;
		ArrayList<Worker> list;

		while (true) {
			n = sc.nextInt();
			if (n == 0) {
				break;
			}
			index = 0;
			list = new ArrayList<Worker>();
			worker = new Worker[4001];

			for (int i = 0; i < n; i++) {
				int id = sc.nextInt();
				long cost = sc.nextLong();
				long lots = sc.nextLong();
				if (worker[id] == null) {
					worker[id] = new Worker(id, cost * lots, index++);
				} else {
					worker[id].result += (cost * lots);
				}
			}

			for (int i = 0; i < 4001; i++) {
				if (worker[i] != null && 1000000 <= worker[i].result) {
					list.add(worker[i]);
				}
			}
			Collections.sort(list);
			if (list.isEmpty()) {
				System.out.println("NA");
			} else {
				for (Worker w: list) {
					System.out.println(w.id);
				}
			}
		}
	}
}