import Control.Applicative
import Data.List
main = do
  numbers <- (map read . words) <$> getLine
  let sortedNumbers = quickSort numbers :: [Int]
  putStrLn $ intercalate " " $ map show sortedNumbers

quickSort [] = []
quickSort (n:xs) = quickSort lt ++ [n] ++ quickSort gteq
  where
    lt = [x | x <- xs, x < n]
    gteq = [x | x <- xs, x >= n]