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 Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;

public class Main {

	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String[] tmp = br.readLine().split(" ");
		long A = Integer.parseInt(tmp[0]);
		long B = Integer.parseInt(tmp[1]);
		long K = Integer.parseInt(tmp[2]);

		List<Long> ans = new ArrayList<Long>();

		for(long i = A;i<A+K;i++){
			if(i>B)break;
			ans.add(i);
		}
		for(long j = B;j>B-K;j--){
			if(j<A)break;
			ans.add(j);
		}

		List<Long> uniq = new ArrayList<Long>(new HashSet<>(ans));

		uniq.sort(null);

		for(int i = 0;i<uniq.size();i++){
			System.out.println(uniq.get(i));
		}
	}

}