#include "bits/stdc++.h"

#define REP(i,num) for(int i=0;i<(num);++i)
#define LOOP(i) while(i--)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto& x:c){cout<<x<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}

using namespace std;
using ll = long long;

constexpr ll atcoder_mod = 1e9+7;

template<typename T=int>
T in(){T x; cin >> x; return (x);}
template<typename T=int,typename C=vector<T>>
C vecin(int N){C x(N);REP(i,N){x[i]=in<T>();}return move(x);}

void vout(){cout << endl;}
template<typename Head,typename... Tail>
void vout(Head&& h,Tail&&... t){cout << ' ' << h;vout(forward<Tail>(t)...);}
void out(){cout << endl;}
template<typename Head,typename... Tail>
void out(Head&& h,Tail&&... t){cout << h;vout(forward<Tail>(t)...);}

class Data{
public:
	int N{-1},E;
	ll S;
	bool operator<(const Data& r){
		return N<r.N;
	}
};

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	
	while(true){
		int N=in();
		if(!N) break;
		map<int,Data> H;
		REP(i,N){
			int E=in();
			ll P=in<ll>(),Q=in<ll>();
			H[E].S+=P*Q;
			H[E].E=E;
			if(H[E].N==-1) H[E].N=i;
		}
		vector<Data> D;
		for(auto& x:H) D.push_back(x.second);
		sort(ALL(D));
		int num=0;
		for(auto& x:D){
			if(x.S>=1000000LL){
				out(x.E);
				num++;
			}
		}
		if(!num) out("NA");
	}
	
	return 0;
}
