import Data.List

main = do
  [a,b,k] <- fmap (map read . words ) getLine
  mapM_ print (solve a b k)

solve :: Int -> Int -> Int -> [Int]
solve a b k =
  nub (sort (ls++us))
  where
    ls = take k [a..b]
    us = take k [b,b-1..a]