N,D,K = map(int,raw_input().split())
dp = [[] for _ in range(1001)]
for i in range(1,N+1):
    for j in range(D+1-i)[::-1]:
        for comb in dp[j]:
            if len(comb) == K: continue
            dp[sum(comb)+i].append(comb+[i])
    dp[i].append([i])
dp[D] = sorted(dp[D])

for comb in dp[D]:
    if len(comb) == K:
        print " ".join(map(str,comb))
        break
else:
    print -1