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

main = do
  s <- getContents
  putStr . concat . map eachDataSet . dataSets . lines $ s

eachDataSet = showResult 
                . map fst . filter ((>= 1000000) . snd)
                . accumulate
                . map (map read . words)
showResult [] = "NA\n"
showResult is = unlines . map show $ is

-- accumulate [[101,10,3],[102,20,1],[101,30,2]] == [(101,90),(102,20)]
accumulate :: [[Int]] -> [(Int,Int)]
accumulate = foldl accum [] . map amount
  where
    amount [i,p,q] = (i, p * q)
    accum [] t = [t]
    accum (t:ts) (i,a) | fst t == i = (i, snd t + a) : ts
                       | otherwise  = t : accum ts (i,a)

-- dataSets ["2","aa","b","1","cc","0"] == [["aa","b"],["cc"]]
dataSets :: [String] -> [[String]]
dataSets (x:xs)
  | n == 0    = []
  | otherwise = take n xs : dataSets (drop n xs)
  where n = read x