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 PHP7 (7.0.15) (judge verdict: Wrong Answer)

<?php
fscanf(STDIN, '%d %d %d', $min, $max, $offset);
$limit = $max - $min;
$offset = ($offset > $limit) ? $limit : $offset;
$min_r = range($min, ($min+$offset)-1);
$max_r = range($max-($offset-1), $max);
//var_dump($min_r, $max_r);
//$min_result = [];
//$max_result = [];
//$limit = $max - $min;
//$c = 1;
//$offset = ($offset > $limit) ? $limit : $offset;
//for($i = 0; $i < $offset; $i++) {
//    $min_result[] = $min_r[$i];
//    $max_result[] = $max_r[$limit-$c];
//    $c++;
//}
$result = array_merge($min_r, $max_r);
//var_dump($result);
sort($result);
$result = array_unique($result);
foreach($result as $no) {
    echo $no. "\n";
}