import Control.Monad

solver::Int -> Int -> Int -> [Int]
solver a b k = if ((b-a)+1) <= (2*k) then [a..b] else [a..(a+(k-1))]++[((b-k)+1)..b]

ls_print::(Show a )=>[a]->IO ()
ls_print ls = forM_ ls (\x -> print x)

main::IO()
main=do
  abkc<-getLine
  let a:b:k:[]= map read (words abkc)
  ls_print (solver a b k)
