N,D,K=map(int,input().split())
dp=[[[]for __ in range(D+1)]for _ in range(K+1)]
for i in range(1,K+1):
    for j in range(1,D+1):
        for k in range(1,N+1):
            if j-k<0:continue
            if not k in dp[i-1][j-k] and len(dp[i-1][j-k])==i-1 and sum(dp[i-1][j-k])+k==j:
                dp[i][j]=dp[i-1][j-k]+[k]
                break
if dp[K][D]==[]:
    print(-1)
else:
    print(*sorted(dp[K][D]))