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

#include <stdio.h>

int main(void)
{
	int a, b, e, f, k, i, j;
  int c[111];
  int d[111];
  int buckets[222] = {0};
  int num[222];
  j = 0;

  scanf("%d %d %d", &a, &b, &k);
 e = a;
 f = b;
  for (i = 0; i < k; i++) {
      c[i] = a;
      a++;
      /*if (c[i] > f) {
      break;
    }*/
  }
  for (i = 0; i < k; i++) {
      d[i] = b;
      b--;
      /*if (d[i] < e) {
      break;
    }*/
    }


for (i = 0; i < k ; i++) {
  buckets[c[i]] = c[i];
  buckets[d[i]] = d[i];
}

for (i = 0; i < 222 ; i++) {
  if (buckets[i] > 0) {
        num[j] = buckets[i];
        if (num[j] >= e && num[j] <= f) {
            printf("%d\n", num[j]);
            j++;
        }
    }
}
return 0;
}