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: Wrong Answer)

/*
author : shah_entrance
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    ll a,b,k,i,diff;
    cin>>a>>b>>k;
    map<ll,ll>m;
    m[a]+=1;
    m[b]+=1;
    diff=b-a+1;
    if(k>=diff)
    {
        for(i=a;i<=b;i++)
            cout<<i<<endl;
    }
    else
    {
        m[k+a]+=1;
        m[b-k]+=1;
        if((a+k)>=(b-k))
            for(i=a;i<=b;i++)
                cout<<i<<endl;
        else
        {
            for(i=a;i<(a+k);i++)
                cout<<i<<endl;
            for(i=(b-k+1);i<=b;i++)
                cout<<i<<endl;
        }
    }
    return 0;
}