#include <iostream>
#include <stdio.h>
#include <string>
#include <string.h>
#include <queue>
#include <cmath>

#define int64 long long int

using namespace std;
typedef pair<int, int> P;

int main()
{
    int flag[4001];
    int n, c, num, val, sale, na;
    P hoge[4001];
    
    while (1) {
        cin >> n;
        if(n == 0) break;
        
        c = 1;
        na = 1;
        memset(flag, 0, sizeof(int)*4001);
        
        for(int i=0; i<n; i++){
            cin >> num >> val >> sale;
            if(flag[num] == 0){
                flag[num] = c;
                hoge[c].first = num;
                hoge[c].second = val * sale;
                c++;
            } else {
                hoge[flag[num]].second += val * sale;
            }
        }
        for(int i=1; i<c; i++){
            if(hoge[i].second >= 1000000){
                na = 0;
                cout << hoge[i].first << endl;
            }
        }
        if(na == 1) cout << "NA" << endl;
    }
    return 0;
}