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

#include<cstdio>
#include<algorithm>
#include<cstring>//升序排列输出
using namespace std;
const int MAXN=100000000ll;
int ans[MAXN+5];
int main()
{
	int a,b,k;
	int m,n;
	int i,t1=0,t2=0;
	scanf("%d %d %d",&a,&b,&k);
	if(a<=b)
	{
		m=a;
		n=b;
	}
	else
	{
		m=b;
		n=a;
	}
	for(i=m;i<=n;i++)
	{
		if(t1!=k)
		{
			t1++;
			ans[i]=1;
		}
		if(t1==k)
			break;
	}
	for(i=n;i>=m;i--)
	{
		if(t2!=k)
		{
			t2++;
			ans[i]=1;
		}
		if(t2==k)
			break;
	}
	for(i=m;i<=n;i++)
		if(ans[i])
			printf("%d\n",i);
	return 0;
}