Problem:
Sale Result

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"

Sample 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 for the Sample Input

1001
1003
NA
2013

Solution in Ruby (judge verdict: Accepted)

class Staff_manage
  def initialize()
    @arr = []
  end
  def set(size)
    @hash = Hash.new(0)
    size.times do
      @no, @price ,@num= gets.chomp.split(' ').each{|x| x.to_i}
      @hash[@no] += @price.to_i * @num.to_i
    end
  end

  def check()
    no_arr = []
    @hash.each do |key, value|
        if value >= 1000000
            no_arr << key
        end
    end
    no_arr << 'NA' if no_arr.size == 0
    @arr << no_arr
  end

  def output()
    @arr.each{|no| puts no}
  end
end

staff = Staff_manage.new()
loop do
  size = gets.chomp.to_i
  break if size == 0

  staff.set(size)
  staff.check()
end
staff.output()