n,d,k=map(int,input().split())
if n>=k:
	A=list(range(1,k+1))
	while sum(A)<d:
		k-=1
		if n<1 or k<0: break
		A[k]+=min(n-A[k],d-sum(A))
		n-=1
else:A=[-1]
print(*A if sum(A)==d else[-1])