import Data.List

solve :: Int -> Int -> Int -> [Int]
solve a b k =
  nub $ take k l ++ drop (len - k) l
  where
    l = [a..b]
    len = length l
  

main = do
  [a,b,k] <- map read . words <$> getLine :: IO [Int]
  mapM print (solve a b k)
