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{
    static Scanner kbd = new Scanner(System.in);
    public static void main(String[] args){
	while(kbd.hasNext()){
	    Man[] man = new Man[4000];
	    int n = kbd.nextInt();
	    if(n!=0) solve(n, man);
	}
    }

    static void solve(int n, Man[] man){
	int i=0, cnt=0;
	while(n>0){
	    i=0;
	    int m = kbd.nextInt();
	    long t = kbd.nextLong();
	    long c = kbd.nextLong();
	    while(i!=cnt && man[i].getM()!=m) i++;
	    if(i==cnt){
		man[i] = new Man(m, t*c);
		cnt++;
	    }
	    else{
		man[i].plus(t*c);
	    }
	    n--;
	}
	long a=0;
	for(i=0; i<cnt; i++){
	    if(man[i].getP() >= 1000000){
		System.out.println(man[i].getM());
		a++;
	    }
	}
	if(a==0){
	    System.out.println("NA");
	}
    }
}

class Man{
    int m;
    long p;
    public Man(int num, long pt){
	m = num;
	p = pt;
    }
    public void plus(long pt){
	p += pt;
    }
    public long getP(){
	return p;
    }
    public long getM(){
	return m;
    }
}