4073.hs

import Prelude hiding ( cycle )
import Control.Monad  ( liftM )

cycle n c
  | n == 1     = c
  | odd n     = cycle (3*n+1) c+1
  | otherwise = cycle (div n 2) c+1

findMax i j =  foldr (max . (`cycle` 1)) 0 [i..j]

getMax :: String -> IO ()
getMax values = do
                 let (a:b:_) = words values
                 putStrLn $ unwords [a,b,show (findMax (read a) (read b))]

main :: IO ()
main = do
  cases <- lines `liftM` getContents
  mapM_ getMax cases
  return ()