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

class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        String line;
        while (!(line = br.readLine()).equals("0")) {
            HashMap<Integer, Long> map = new HashMap<Integer, Long>();
            ArrayList<Integer> shine = new ArrayList<Integer>();
            int n = Integer.parseInt(line);
            for (int i = 0; i < n; i++) {
                String[] input = br.readLine().split(" ");
                int e = Integer.parseInt(input[0]);
                if (!shine.contains(e))
                    shine.add(e);
                long p = Long.parseLong(input[1]);
                long q = Long.parseLong(input[2]);

                if (map.containsKey(e)) {
                    if (map.get(e) == Long.MAX_VALUE) {
                        continue;
                    }
                    if (p * q + map.get(e) >= 1000000) {
                        map.put(e, Long.MAX_VALUE);
                    } else {
                        map.put(e, p * q + map.get(e));
                    }
                } else {
                    if (p * q >= 1000000) {
                        map.put(e, Long.MAX_VALUE);
                    } else {
                        map.put(e, p * q);
                    }
                }
            }

            boolean isNA = true;
            for (Object x : shine.toArray()) {
                int e = (int) x;
                if (map.get(e) == Long.MAX_VALUE) {
                    System.out.println(e);
                    isNA = false;
                }
            }

            if (isNA)
                System.out.println("NA");
        }
    }
}
