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
#include <cstdio>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, ll> P;
 
int n;
 
int main(){
	while(scanf("%d", &n),n){
		vector<P> vec;
		for(int i = 0; i < n; i++){
			int x; ll p, q;
			scanf("%d%lld%lld", &x, &p, &q);
			bool ok = true;
			for(int j = 0; j < vec.size(); j++){
				if(vec[j].first == x){
					vec[j].second += p*q;
					ok = false;
					break;
				}
			}
			if(ok) vec.push_back(P(x,p*q));
		}
		bool ok = true;
		for(int i = 0; i < vec.size(); i++){
			if(vec[i].second >= 1000000){
				ok = false;
				printf("%d\n", vec[i].first);
			}
		}
		if(ok) printf("NA\n");
	}
	return 0;
}