main = do
  (n:a:b:xs) <- (map read) . words <$> getLine
  let (x,y) = solve n a b
  putStrLn . unwords . map show $ [x,y]

solve :: Int -> Int -> Int -> (Int, Int)
solve n a b = (min a b, max 0 (a+b-n))
