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 <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <utility>
#include <algorithm>
using namespace std;

int main(void){

    long long int a, b, k;
    cin>>a>>b>>k;
    
    vector<long long int> c;
    
    int t=a+k<b?a+k:b;
    for(int i=a; i<t; i++){
        c.push_back(i);
    }
    
    t=b-k+1>a?b-k+1:a;
    for(int i=t; i<=b; i++){
        c.push_back(i);
    }
    sort(c.begin(), c.end());
    int offset=0;
    
    for(int i=1; i<c.size(); i++){
        if(c[i-1]==c[i]){
            c[i-1]=-1;
            offset++;
        }
    }
    
    sort(c.begin(), c.end());
    
    for(int i=offset; i<c.size(); i++){
        cout<<c[i]<<endl;
    }
}