#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctype.h>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>
#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define F(i,j,k) fill(i[0],i[0]+j*j,k)
#define P(p) cout<<(p)<<endl;
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define INF 1<<25
#define MAX 100000000
#define pb push_back
using namespace std; 
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int,int> pii;
typedef pair<long,long> pll;
typedef long long ll;
  
int main(){
  int n;
  while(1){
    cin >> n;
    if(n == 0) break;
    int p[4001];
    for(int i = 0;i < 4001;i++){
      p[i] = 0;
    } 
    for(int i = 0;i < n;i++){
      int b,t,s;
      cin >> b >> t >> s;
      p[b] += t*s;
    }
    int count = 0;
    for(int i = 1;i < 4001;i++){
      if(p[i] >= 1000000){
	P(i);
	count++;
      }
    }
    if(count == 0){
      P("NA");
    }
  }
  return 0;
}