import Data.List as List

main :: IO ()
main = do
    n <- (map read) . words <$> getLine
    mapM_ (putStrLn . show) (solve n)

solve :: [Int] -> [Int]
solve (a:b:k:_) = filter (\x -> a <= x && x <= b) $ union [a..a+k-1] [b-k+1..b]