import Data.List

side :: Int -> [Int] -> ([Int], [Int])
side 0 _  = ([],[])
side _ [] = ([],[])
side k l = (n : pre1, m : pre2)
  where (n:ns) = l
        (m:_) = reverse ns 
        (pre1, pre2) = side (k-1) $ init ns

main = do
  [a,b,k] <- map read.words <$> getLine
  let (fst, snd) = side k [a..b]
      nums = fst ++ reverse snd
  mapM_ print nums