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: Runtime Error)

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;



public class Main{

	public static void main(String args[]){

		Scanner sc = new Scanner(System.in);
		 int a = sc.nextInt();
		 int b = sc.nextInt();
		 int k = sc.nextInt();
		 int j = 0;
		 int n = 0;
		 
		 
		 int arr[] = new int[b - a + 1];
		
		 for(int i = a; i <= b; i ++) {
			 arr[n] = i;
			 n ++;
		 }
		 
		 for(int i = 0; i < k; i ++) {
			  System.out.println(arr[i]);
			  j = arr[i];
			  if(i == arr.length - 1) {
				  break;
			  }
		 }
		 
		 List<Integer> h = new ArrayList<Integer>();
		 
		 for(int i = 0; i < k; i ++) {
			 if(arr[arr.length - 1 - i] > j) {
				 h.add(arr[arr.length - 1 - i]);
				 if(i == arr.length - 1) {
					 break;
				 }
		     }else if(i == arr.length - 1) {
					  break;
		     }
			 
		 }
		 Collections.sort(h);
		for(int i = 0; i < h.size(); i ++) {
			System.out.println(h.get(i));
		}
	}
}