// yukicoder: No.115 遠足のおやつ
// 2019.4.13 bal4u

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <math.h>

int ans[15];

int main()
{
	int i, N, D, K;

	scanf("%d%d%d", &N, &D, &K);
	if (N*(N + 1) / 2 < D || K * (K + 1) / 2 > D) goto ng;
	for (i = 1; i < K; i++) ans[i-1] = i;
	ans[K-1] = D - K*(K-1)/2;
	if (ans[K-1] > N) {
		int f = 0, max = N;
		i = K; while (--i >= 0) {
			if (ans[i] + f > max) f += ans[i] - max, ans[i] = max;
			else { ans[i] += f, f = 0; break; }
			max--;
		}
		if (f) goto ng;
	}
	printf("%d", ans[0]);
	for (i = 1; i < K; i++) printf(" %d", ans[i]);
	printf("\n");
	return 0;
ng: puts("-1");
	return 0;
}