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.Scanner;
import java.util.HashMap;
import java.util.Comparator;
import java.util.Arrays;
class Record
{
    int id;
    int uriage;
    int jyun;

    Record(int id, int uriage, int jyun)
    {
	this.id = id;
	this.uriage = uriage;
	this.jyun = jyun;
    }
    
    int getId()
    {
	return this.id;
    }
    int getUriage()
    {
	return this.uriage;
    }
    int getJyun()
    {
	return this.jyun;
    }
    int addUriage(int uri)
    {
	this.uriage += uri;
	return this.uriage; 
    }
}

class CmpJyun implements Comparator<Record> {
    public int compare(Record record1, Record record2) {
	return record1.getJyun() - record2.getJyun();
  }
}

public class Main
{
    public static void main(String[] args)
    {
	final int lim=1000000;
	CmpJyun rc = new CmpJyun();
	Scanner scan = new Scanner(System.in);
	while (true) {
	    HashMap<Integer,Record> h = new HashMap<Integer,Record>();
	    int n = scan.nextInt();
	    if (n==0) 
		break;

	    for (int jyun=0; jyun<n; jyun++){
		int id    = scan.nextInt();
		int tanka = scan.nextInt();
		int ryou  = scan.nextInt();
		if  (h.containsKey(id)){
		    h.get(id).addUriage(tanka*ryou);
 		} else {
		    h.put(id,new Record(id, tanka*ryou, jyun));
		}
	    }

	    Record[] rec = new Record[h.size()];
	    int j=0;
	    for (Integer id : h.keySet()) {
		rec[j] = h.get(id);
		j += 1;
	    }
	    boolean none=true;
	    Arrays.sort(rec, rc);
	    for (int i=0; i<h.size(); i++){
		if (rec[i].getUriage() >= lim){
		    System.out.println(rec[i].getId());
		    none=false;
		}
	    }
	    if (none)
		System.out.println("NA");
	}
    }
}