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 Scala (judge verdict: Accepted)

import scala.io.StdIn.{readInt,readLine}
import scala.collection.mutable.LinkedHashMap

object Main extends App {
  Iterator.continually(readInt).takeWhile(_!=0).foreach { n =>
    val map = new LinkedHashMap[Long, Long]

    for(i<-1 to n) {
      val e = readLine.split(" ").map(_.toLong)
      if(!map.contains(e(0))) map += e(0) -> e(1)*e(2)
      else map(e(0)) += e(1)*e(2)
    }

    val filtered = map.filter( _._2 >= 1000000 )
    if(filtered.isEmpty) println("NA") else filtered.foreach( e => println(e._1))
  }
}