n, d, k = map(int, input().split())
dp = [[-1]*(d+1) for i in range(k+1)]
dp[0][0] = tuple([])
for i in range(1, n+1):
    for j in reversed(range(k+1)):
        for l in reversed(range(d+1)):
            if dp[j][l] == -1:
                continue
            if j+1 <= k and l+i <= d:
                nt = list(dp[j][l])+[i]
                nt = tuple(nt)
                if dp[j+1][l+i] != -1:
                    dp[j+1][l+i] = min(dp[j+1][l+i], nt)
                else:
                    dp[j+1][l+i] = nt
if dp[k][d] != -1:
    print(*dp[k][d])
else:
    print(-1)