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
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Set;
import java.util.Map;

public class Main {

  public static void main(String[] args) {

    new Main().run();
  }

  public void run() {

    try (BufferedReader br = new BufferedReader(new InputStreamReader(System.in))) {

      int n;
      Map<Integer,Integer> map = new HashMap<>();
      Set<Integer> set = new HashSet<>();
      StringBuilder buf = new StringBuilder();
  
      n = Integer.parseInt(br.readLine());
      while(true) {
        br.lines()
          .limit(n)
          .map( line -> {
            String[] lines = line.split(" ");
            Integer[] nums = new Integer[] {
              Integer.parseInt(lines[0]),
              Integer.parseInt(lines[1]) * Integer.parseInt(lines[2])
            };

            Integer val = map.get(nums[0]);
            if(val == null)
              map.put(nums[0],nums[1]);
            else
              map.replace(nums[0],nums[1]+=val);

            return nums;
          })
          .filter(nums -> nums[1] >= 1_000_000)
          .forEach(nums -> {
            if(set.add(nums[0]))
              buf.append(nums[0]).append("\n");
          });
        
        if(set.isEmpty()) buf.append("NA\n");

        if((n = Integer.parseInt(br.readLine())) == 0 ) break;
        map.clear();
        set.clear();
      }

      System.out.print(buf);
        
    } catch (IOException e) {
      System.err.println(e);
    }
  }
}
