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 Control.Applicative
import Control.Monad
import Data.List

main :: IO ()
main = do
  inputs <- getContentsUntil0
  mapM_ putStrLn $ solve inputs
  
getContentsUntil0 :: IO [[(Int, Int)]]
getContentsUntil0 = do
  c <- readLn :: IO Int
  if c == 0
    then return []
    else do
    cs <- readContents c
    let cs' = map (\x -> (head x, (product . tail) x)) cs
    liftM2 (:) (return cs') getContentsUntil0

readContents :: Int -> IO [[Int]]
readContents n = replicateM n getInts
  
getInts :: IO [Int]
getInts = map read . words <$> getLine

solve :: [[(Int, Int)]]-> [String]
solve [] = []
solve (n:ns) = ls' ++ solve ns
  where
    ls = searchEmployee n
    ls' = case ls of
      [] -> ["NA"]
      [-1] -> []
      xs -> foldr (\a b -> show a : b) [] xs
      
searchEmployee :: [(Int, Int)] -> [Int]
searchEmployee [] = []
searchEmployee xs =  map fst $ filter ((>= 1000000).snd) $
                     map (foldl1 (\a b -> (fst b, snd a + snd b))) $
                     groupBy (\a b -> fst a == fst b) $ sort xs