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

#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
    int p=0,q;
    long long a,b,k;
    cin>>a>>b>>k;
    q=k;
    if((b-a)/k>=2){
            for(int i = 0; i < k; i++){
                cout<<a+p<<endl;
                p++;
            }
            for(int i = 0; i < k; i++){
                cout<<b-q+1<<endl;
                q--;
            }
 
    }
    else{
        for(int i = 0;i <= b-a; i++){
            cout<<a+i<<endl;
        }
    }
  return 0;
}