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 Ruby (2.3.3) (judge verdict: Wrong Answer)

n = gets.split.map(&:to_i);
vec = (n[0]..(n[1])).to_a;
if n[1] < n[2]
		(n[0]..n[1]).each do |i|
				puts(i);
		end
else
		c = 0
		vec.slice(0,n[2]).each do |i|
				c = i;
				puts(i);
		end
		vec.reverse().slice(0,n[2]).each do |i|
				if c != i
								puts(i);
				end
		end
end