N,D,K = map(int,raw_input().split())
s = range(1,K)+[D-sum(range(1,K))]
if s[-2] >= s[-1]: print -1
else:
    for i in range(1,K):
        while s[-i-1] <= N-i-1 and s[-1] > N:
            s[-i-1] += 1; s[-1] -= 1
    print " ".join(map(str,s)) if max(s) <= N else -1