There is data on sales of your company. Your task is to write a program which identifies good workers.

The program should read a list of data where each item includes the employee ID i, the amount of sales q and the corresponding unit price p. Then, the program should print IDs of employees whose total sales proceeds (i.e. sum of p × q) is greater than or equal to 1,000,000 in the order of inputting. If there is no such employees, the program should print "NA". You can suppose that n < 4000, and each employee has an unique ID. The unit price p is less than or equal to 1,000,000 and the amount of sales q is less than or equal to 100,000.



Input

The input consists of several datasets. The input ends with a line including a single 0. Each dataset consists of:


n (the number of data in the list)
i p q
i p q
:
:
i p q


Output

For each dataset, print a list of employee IDs or a text "NA"

Example

Input

4
1001 2000 520
1002 1800 450
1003 1600 625
1001 200 1220
2
1001 100 3
1005 1000 100
2
2013 5000 100
2013 5000 100
0


Output

1001
1003
NA
2013
#include <bits/stdc++.h>
const char* version[] = {"+---------version--------------+",
                         "+last update:2014/10/28/20:26  +",
                         "+author:Shitonai Rindo         +",
                         "+------------------------------+", "endl"};
const char* help[] = {"+--------help-------------------------+",
                      "+summary:sale Result                  +",
                      "+required inputs (stdin):data count,  +",
                      "+sales data                           +",
                      "+supported comandline options:-h -v   +",
                      "+-------------------------------------+",
                      "endl"};
void manage_helpAndVersionOutput(char arg_line[]);
void saleResult(int datac);
bool is_existID(int query, int database[]);
bool is_first = true;
const int MAX_SALESMAN_MEMBER = 4000;
const int SENTINEL = 999999;
int main(int argc, char* argv[]) {
  manage_helpAndVersionOutput(argv[argc - 1]);
  int datac;
  while (scanf("%d", &datac), datac) {
    saleResult(datac);
  }
  return 0;
}
void saleResult(int datac) {
  int salesmanID, salePrice, soldCount;
  int roop_resultdata;
  int IDs[MAX_SALESMAN_MEMBER + 1], ID_result[MAX_SALESMAN_MEMBER + 1],
      IDcount = 0;
  int roop_init;
  for (roop_init = 0; roop_init <= MAX_SALESMAN_MEMBER; roop_init++) {
    ID_result[roop_init] = 0;
  }
  scanf("%d %d %d", &salesmanID, &salePrice, &soldCount);
  IDs[IDcount++] = salesmanID;
  IDs[IDcount] = SENTINEL;
  ID_result[salesmanID] += salePrice * soldCount;
  for (roop_resultdata = 1; roop_resultdata < datac; roop_resultdata++) {
    scanf("%d %d %d", &salesmanID, &salePrice, &soldCount);
    ID_result[salesmanID] += salePrice * soldCount;
    if (!is_existID(salesmanID, IDs)) {
      IDs[IDcount++] = salesmanID;
      IDs[IDcount] = SENTINEL;
    }
  }
  int roop_output;
  bool NAflag = true;
  for (roop_output = 0; IDs[roop_output] != SENTINEL; roop_output++) {
    if (ID_result[IDs[roop_output]] >= 1000000) {
      if (is_first) {
        is_first = false;
      } else {
        printf("\n");
      }
      printf("%d", IDs[roop_output]);
      NAflag = false;
    }
  }
  if (NAflag) {
    if (is_first) {
      is_first = false;
    } else {
      printf("\n");
    }
    printf("NA");
  }
}
bool is_existID(int query, int database[]) {
  int roop_search;
  for (roop_search = 0; database[roop_search] != SENTINEL; roop_search++) {
    if (query == database[roop_search]) {
      return true;
    }
  }
  return false;
}
void manage_helpAndVersionOutput(char arg_line[]) {
  int line;
  if (strcmp(arg_line, "-h") == 0) {
    for (line = 0; strcmp(help[line], "endl"); line++) {
      printf("%s\n", help[line]);
    }
    exit(0);
  } else if (strcmp(arg_line, "-v") == 0) {
    for (line = 0; strcmp(version[line], "endl"); line++) {
      printf("%s\n", version[line]);
    }
    exit(0);
  }
}
