N,D,K = map(int,input().split())

ans = [-1 for i in range(K)]
dp = [[[-1 for k in range(D+1)]for j in range(K+1)]for i in range(N+1)]

def dfs(n,k,d):
	if k == K:
		if d == D:
			return True
		else:
			return False
	if n >= N:
		return False
	if dp[n][k][d] != -1:
		return dp[n][k][d]
	for i in range(n+1,N+1):
		ans[k] = i
		if d+i <= D and dfs(i,k+1,d+i):
			return True
		ans[k] = -1
	dp[n][k][d] = False
	return False
if not dfs(0,0,0):
	print(-1)
else:
	print(' '.join([str(i) for i in ans]))