#include <bits/stdc++.h>
int main() {
  int n, no;
  long long yen, num;
  bool update = false;
  long long total[4001];
  std::queue<int> que;
  for (int i = 0; i < 4001; ++i) {
    total[i] = 0;
  }
  std::cin >> n;
  while (n != 0) {
    for (int i = 0; i < n; ++i) {
      scanf("%d %lld %lld", &no, &yen, &num);
      total[no] += yen * num;
      que.push(no);
    }
    while (!que.empty()) {
      if (total[que.front()] >= 1000000) {
        std::cout << que.front() << std::endl;
        total[que.front()] = 0;
        update = true;
      }
      que.pop();
    }
    if (!update) {
      std::cout << "NA" << std::endl;
    }
    std::cin >> n;
  }
  return 0;
}
