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

public class Main {

    public static void main(String[] args) throws IOException {
//        long[] emp = new long[4001];
            

//        BufferedReader bReader =
//                new BufferedReader(new InputStreamReader(System.in));
        Scanner s = new Scanner(System.in); 

//        aryClear(emp);
        int empValue;
        while ((empValue = s.nextInt()) != 0) {
        	int overCount = 0, empID, n;
        	long price, quantitiy;
        	long total;

        	HashMap<Integer,Long> emp = new HashMap<Integer,Long>();
        	Queue<Integer> iQueue = new LinkedList<Integer>();

            n = 0;
            while (n < empValue) {
//                String str = bReader.readLine();
//                String[] editedstr = str.split(" ");
                empID = s.nextInt(); //Integer.parseInt(editedstr[0]);         //社員番号
                price = s.nextLong(); //Integer.parseInt(editedstr[1]);         //単価
                quantitiy = s.nextLong(); //Integer.parseInt(editedstr[2]);     //販売個数
                total = price * quantitiy;                      //実績

                if (!emp.containsKey(empID)) {                         //初めての入力
                    emp.put(empID, total);
                    iQueue.offer(empID);
                } else if (emp.get(empID) <= 1000000) {   //2回目以降の入力かつ100万を超えない値の場合
                    emp.put(empID, emp.get(empID) + total);
                    
                } else {
                }
                n++;
            }

//            for (int a : iQueue) {
            Integer a;
            while ((a = iQueue.poll()) != null) {
                //System.out.println(a);        //debug
                if (emp.get(a) >= 1000000) {
                    System.out.println(a);
                    overCount++;
                }
            }
            if (overCount == 0) {
                System.out.println("NA");
            }
            overCount = 0;
            iQueue.clear();
//            emp = new long[4001];
//            aryClear(emp);
            emp.clear();
        }
    }

    public static void aryClear(long[] ary) {
        for (int i = 0; i <= 4000; i++) {
            ary[i] = -1;
        }
    }
}