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 9.2.1) (judge verdict: Wrong Answer)

#include <stdio.h>

int main() {

    int a, b, k;
    scanf("%d %d %d", &a, &b, &k);

    int arr[k * 2];

    int cnt = 0;
    int maxdata = a + k;

    int counter = (b - a <= k ? b - a : k);

    for (int i = 0; i < counter; i++) {
        //printf("%d\n", a + i);
        arr[i] = a + i;
        cnt++;
    }
    //printf("%d %d\n", maxdata, b - k + 1);

    if (maxdata <= b - k + 1) {
        maxdata = b - k + 1;
    }

    for (int j = maxdata; j <= b; j++) {
        if (j >= a) {
            //printf("%d\n", j);
            arr[cnt] = j;
            cnt++;
        }
    }

    for (int k = 0; k < cnt; k++) {
        printf("%d\n", arr[k]);
    }

    return 0;
}