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.util.ArrayList;
import java.util.List;
import java.util.Scanner;
import java.util.TreeSet;

public class Main {

	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int A = scanner.nextInt();
		int B = scanner.nextInt();
		int K = scanner.nextInt();

		List<Integer> list1 = new ArrayList<>();

		//小さいほうからK番目以内
		for (int i = A; i < A + K; i++) {
			//A 以上 B 以下の整数
			if (i >= A && i <= B) {
				list1.add(i);
			}
		}

		List<Integer> list2 = new ArrayList<>();

		//大きいほうからK番目以内
		for (int i = B; i > B - K; i--) {
			//A 以上 B 以下の整数
			if (i >= A && i <= B) {
				list2.add(i);
			}
		}

		List<Integer> list = new ArrayList<>();
		list.addAll(list1);
		list.addAll(list2);

		//昇順に並び替え、重複削除
		List<Integer> x = new ArrayList<>(new TreeSet<>(list));

		for (int i : x) {
			System.out.println(i);
		}

	}
}