#include<iostream>
#include<cstdlib>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
int s[1010];
int main()
{
    int a,b,k;
    scanf("%d%d%d",&a,&b,&k);
    if(b-a-1<=k)
    {
        for(int i=a;i<=b;i++)
            printf("%d\n",i);
    }
    else
    {
        int j=0;
        for(int i=0;j<=k+1;i++)
        {
            s[j++] = a+i;
            if(j<=k+1)
                s[j++] = b-i;
            else
                break;
        }
        sort(s,s+k+2);
        for(int i=0;i<=k+1;i++)
            printf("%d\n",s[i]);
    }
    return 0;
}
