N,D,K = map(int,input().split())
ans = [-1] * K
def dfs(n,d,k):
	if k == 0:
		return d == 0
	for i in range(n+1,N+1):
		if d-i < 0 or d < k * i:
			continue
		if dfs(n+1,d-i,k-1):
			ans[n] = i
			return True
	return False
print(' '.join([str(a) for a in ans]) if dfs(0,D,K) else -1)