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 sc = new Scanner(System.in);
        while (sc.hasNext()) {
            execute(sc);

        }
    }

    static void execute(Scanner sc) {
        int n = Integer.parseInt(sc.nextLine());
        if (n == 0) {
            return;
        }
        Map<String, Long> map = new LinkedHashMap<String, Long>();
        long price, count, rs;
        for (int i = 0; i < n; i++) {
            rs = 0;
            String[] line = sc.nextLine().split(" ");
            if (map.containsKey(line[0])) {
                rs = (Long) map.get(line[0]);
            }
            price = Long.parseLong(line[1]);
            count = Long.parseLong(line[2]);
            map.put(line[0], price * count + rs);
        }
        boolean exists = false;
        for (String key : map.keySet()) {
            if (map.get(key) >= 1000000) {
                System.out.println(key);
                exists = true;
            }
        }
        if (!exists) {
            System.out.println("NA");
        }
    }
}

