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 C (GCC 5.4.1) (judge verdict: Accepted)

#include<stdio.h>
int main(void) {
	int a, b, k;
	int ans[10000];
	int count = 0;
	//int countb = 0;
	scanf("%d %d %d", &a, &b, &k);
	int x=0 ;
	int flag = 0;
	int count1 = 0;
	if (b <= k) {
		for (int i = a; i <= b; i++) {
			printf("%d\n", i);
		}
		return 0;
	}
	else {
		if (a == b) {
			printf("%d\n", a);
			return 0;
		}
		else {
			for (int i = a; i <=b; i++) {
				count1++;
				if (count1 > k) {
					break;
				}
				ans[count++] = i;
			}
			count1 = 0;
			for (int i = b; i >= a; i--) {
				flag = 0;
				count1++;
				if(count1 > k) {
					break;
				}
				for (int j = 0; j < count; j++) {
					if (ans[j] == i) {
						flag = 1;
						break;
					}
					
				}
				if (flag == 0) {
					ans[count++] = i;
				}
			}
			
			
			int temp;
			for (int i = 0; i < count - 1; i++) {
				for (int j = i + 1; j < count; j++) {
					if (ans[i] > ans[j]) {
						temp = ans[i];
						ans[i] = ans[j];
						ans[j] = temp;
					}
				}

			}
			for (int i = 0; i < count; i++) {
				printf("%d\n", ans[i]);
			}
		}
	}
	return 0;
}