import Data.List  -- sort

-- the substantial part of the algorithm

height_of_top3 :: [Int] -> [Int]
height_of_top3 = (take 3) . reverse . sort

-- the algorithm with I/O

main :: IO ()
main = do
  inp <- getContents    -- read all input
  let ls = lines inp    -- break it into a list
      hs :: [Int]
      hs = map read ls  -- convert into [Int]
      ts = height_of_top3 hs  -- the answer
  printList ts

printList :: Show a => [a] -> IO ()
printList ls = putStr $ unlines (map show ls)