N,D,K = map(int,input().split())
INF = -(10**9+7)
dp = [[INF for j in range(D+1)] for i in range(K+1)]
dp[0][0] = 0
for i in range(K):
	for j in range(D+1):
		if dp[i][j] == INF:
			continue
		for k in range(dp[i][j]+1,N+1):
			if j+k <= D:
				dp[i+1][j+k] = max(dp[i+1][j+k],k)
if dp[K][D] == INF:
	print(-1)
	exit(0)
ans = []
nowD = D
for i in range(K,0,-1):
	ans.append(dp[i][nowD])
	nowD -= dp[i][nowD]
print(' '.join([str(i) for i in ans[::-1]]))