#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
// まだ！
// Yukicoder №115 遠足のおやつ ★★
// https://yukicoder.me/problems/no/115
// ***********************
// for debug
#define DEBUGd
// -----------

#define NOP do{}while(0)
#ifdef DEBUG
#include <time.h>
#define TRACE(...) do{printf(__VA_ARGS__);fflush(stdout);}while(0)
#define TRACECR do{putchar_unlocked('\n');fflush(stdout);}while(0)
static clock_t	startclock;
void DEBUGINIT(void){TRACE("--DEBUG MODE --\n");startclock=clock();}
void DEBUGEND(void){startclock=clock()-startclock;TRACE("--finish --\ntime is %.3fms",startclock/1000.);}
#else
#define TRACE(...) NOP
#define TRACECR NOP
void DEBUGINIT(void){return;}
void DEBUGEND(void){return;}
#endif

#define	mypc(d)	putchar_unlocked((int)(d))
#define PRINCR mypc('\n')
#define NOCR(strig) do{char *p;p=strchr(strig,'\n');if(p)*p='\0';}while(0)
// The out-of-date function
#define	asctime(...)	asctime_s(...)
#define	ctime(...)		ctime_s(...)
#define	strlen(a)	mystr_len(a)

// for stdio
#define GETLINE(str) do{char *p;fgets(str,sizeof(str),stdin);p=strchr(str,'\n');if(p)*p='\0';}while(0)
#define mygc(c) (c)=getchar_unlocked()
static char *GETWORD(char* str) {char c;char *cp;cp=&str[0];mygc(c);while(c!=EOF){if((c==' ')||(c=='\n'))break;*cp++=c;mygc(c);}*cp='\0';return &str[0];}
#define	GETINTS(a,b) {char s[34];int *ap=a;REP(i,b){GETWORD(s);*ap++=atoi(s);}}
static int GETLINEINT(void) {char s[34];GETLINE(s);return atoi(s);}
static int GETWORDINT(void) {char s[34];GETWORD(s);return atoi(s);}
static long GETWORDLONG(void) {char s[34];GETWORD(s);return atol(s);}
static int maxi(int a,int b){if((a)>(b)){return a;}return b;}
static long maxl(long a,long b){if(a>b){return a;}return b;}
#define SWAP(type,a,b) do{type _c;_c=a;a=b;b=_c;}while(0)
#define MAX(a,b)	((a)>(b)?(a):(b))
#define MIN(a,b)	((a)<(b)?(a):(b))
#define REP(a,b) for(int a=0;a<(int)(b);++a)
#define REP1(a,b) for(int a=1;a<=(int)(b);++a)
#define Possible(a) 	   printf("%s",((a)?"Possible":"Impossible"))
#define possible(a) 	   printf("%s",((a)?"possible":"impossible"))

int	N,D,K;
int	badf=0;
// *********************
// *********************
int check(int start, int last, int money, int nokori){
	if (last - start + 1 < nokori) return 0;
	int low = 0;
	int high = 0;
	for (int i = 0; i < nokori; i++)
	{
		low += start + i;	// 下から買った場合
	}
	for (int i = 0; i < nokori; i++)
	{
		high += last - i;	// 上から買った場合
	}
	return (low <= money && high >= money);	// 買う余裕がある
}

// *********************
int main( void ) {
	int	sum = 0;
	int	first = 1;

	DEBUGINIT();
	N = GETWORDINT();	// 種類
	D = GETWORDINT();	// 目標金額
	K = GETWORDINT();	// 個数

	if( (K+1)*K/2 > D ) {
		// Ｄを超えてしまう
		badf = 1;
	}
	if( (N+N-K-1)*K/2 < D ) {
		// Ｄに届かない
		badf = 1;
	}

	if( !badf ) {	// 存在する
		K--;
		REP1(i,N) {
			if( check( i+1, N, D-i , K) ) {
				// 買える
				if( !first ) printf(" ");
				first = 0;
				printf("%d", i);
				D -=i;
				K--;
			}
		}
	} else {
		printf("%d\n",-1);
	}
	DEBUGEND();
}