#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    int n;
    while(cin >> n, n){
        vector<ll> cnt(4001);
        int val = 0;
        for (int i = 0; i < n; ++i) {
            int a, b, c;
            scanf("%d %d %d", &a, &b, &c);
            cnt[a] += (ll)b*c;
            if(cnt[a] >= 1000000){
                cnt[a] = -INF<ll>;
                cout << a << "\n";
                val++;
            }
        }
        if(!val) puts("NA");
    }
    return 0;
}
