AOJ0100.cpp

#include <bits/stdc++.h>
using namespace std;

using VS = vector<string>;    using LL = long long;
using VI = vector<int>;       using VVI = vector<VI>;
using PII = pair<int, int>;   using PLL = pair<LL, LL>;
using VL = vector<LL>;        using VVL = vector<VL>;

#define ALL(a)  begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
#define FORR(i, s, e) for (int(i) = (s); (i) > (e); (i)--)
//#pragma GCC optimize ("-O3") 
#ifdef YANG33
#include "mydebug.hpp"
#else
#define DD(x) 
#endif
const int INF = 1e9;                          const LL LINF = 1e16;
const LL MOD = 1000000007;                    const double PI = acos(-1.0);

/* -----  2019/07/20  Problem: AOJ 0100 / Link: https://onlinejudge.u-aizu.ac.jp/challenges/search/volumes/0100  ----- */


int main() {
	LL N;
	while (cin >> N, N) {
		VL a(4000);
		VI use(4000, 0);
		VI ans;
		FOR(i, 0, N) {
			LL b, c, d; cin >> b >> c >> d;
			b--;
			a[b] += c * d;
			if (a[b] >= 1000000 && !use[b]) {
				use[b] = 1;
				ans.push_back(b + 1);
			}
		}
		if (SZ(ans)) {
			FOR(i, 0, SZ(ans)) {
				cout << ans[i] << "\n";
			}
		}
		else {
			cout << "NA\n";
		}
	}

	return 0;
}