Problem:
Score : 200 points

Problem Statement

Print all the integers that satisfies the following in ascending order:

Among the integers between A and B (inclusive), it is either within the K smallest integers or within the K largest integers.

Constraints

1 \leq A \leq B \leq 10^9

1 \leq K \leq 100

All values in input are integers.

Input

Input is given from Standard Input in the following format:

A B K

Output

Print all the integers that satisfies the condition above in ascending order.

Sample Input 1

3 8 2

Sample Output 1

3
4
7
8

3 is the first smallest integer among the integers between 3 and 8.

4 is the second smallest integer among the integers between 3 and 8.

7 is the second largest integer among the integers between 3 and 8.

8 is the first largest integer among the integers between 3 and 8.

Sample Input 2

4 8 3

Sample Output 2

4
5
6
7
8

Sample Input 3

2 9 100

Sample Output 3

2
3
4
5
6
7
8
9

Solution in Haskell (GHC 7.10.3) (judge verdict: Time Limit Exceeded)

import Control.Applicative ((<$>))
import Control.Monad (mapM_)
import Data.Char (isSpace)
import Data.List (reverse, unfoldr, unlines)
import Data.ByteString.Char8 (ByteString)
import qualified Data.ByteString.Char8 as BSC8

getL :: (ByteString -> [Int]) -> IO [Int]
getL f = f <$> BSC8.getLine

readIL :: (ByteString -> Maybe (Int, ByteString)) -> (ByteString -> [Int])
readIL f = unfoldr g
    where g s = do
            (n, s') <- f s
            return (n, BSC8.dropWhile isSpace s')

main :: IO ()
main = do
    [a, b, k] <- getL (readIL BSC8.readInt)
    let n = b - a + 1
    mapM_ print $ reverse $ solve 1 k n [a..b] []

solve :: Int -> Int -> Int -> [Int] -> [Int] -> [Int]
solve _ _ _ [] ans = ans
solve i k n (x:xs) ans
    | i <= k || (n - k + 1) <= i = solve (i+1) k n xs (x:ans)
    | otherwise                  = solve (i+1) k n xs ans