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

public class Sale_Result {

	public static void main(String[] args) throws Exception {
		// TODO ?????????????????????????????????????????????
		boolean[] arg = null;
		int length=0;
        int i=0;
        boolean first=false;
        ArrayList arr=new ArrayList();
        Map<Integer,Integer> map=new HashMap<Integer,Integer>();

		try (BufferedReader br = new BufferedReader(new InputStreamReader(System.in))) {
            String line;
            while ((line = br.readLine()) != null ) {
            	if(line.equals("0")){
            		break;
            	}
            	String[] tokens = line.split(" ");
            	if(tokens.length==1){
            		i=0;
            		first=false;
            		map=new HashMap();
            		length=Integer.parseInt(tokens[0]);
            	}else{
            		int a= Integer.parseInt(tokens[0]);
            		int b = Integer.parseInt(tokens[1]);
            		int c = Integer.parseInt(tokens[2]);
            		if(map.get(a)==null){
            			map.put(a, b*c);
            		}else{
            			map.put(a, map.get(a)+b*c);
            		}
            		i++;
            	}
            	if(i==length){
            		for(Map.Entry<Integer, Integer> entry : map.entrySet()) {
            			if(entry.getValue()>=1000000){
            				arr.add(entry.getKey());
                			first=true;
                		}
            		}

            		if(!first){
            			arr.add("NA");
            		}
            	}
            }
		}
		for(int k=0;k<arr.size();k++){
			System.out.println(arr.get(k));
		}
	}

}