N, D, K = map(int, input().split())
if N == 1:
    if D == 1 and K == 1:
        print(1)
    else:
        print(-1)
    exit()

dp = [[[False] * (D + 1) for j in range(K + 1)] for i in range(N)]
dp[N - 1][0][0] = True
if N <= D:
    dp[N - 1][1][N] = True
for i in range(N - 2, -1, -1):
    for j in range(K + 1):
        for k in range(D + 1):
            dp[i][j][k] |= dp[i + 1][j][k]
    for j in range(1, K + 1):
        for k in range(D + 1):
            if k + i + 1 <= D:
                dp[i][j][k + i + 1] |= dp[i + 1][j - 1][k]
ans = []
for i in range(N - 1):
    k = len(ans)
    d = sum(ans)
    if 0 <= K - k - 1 <= K and 0 <= D - d - i - 1 <= D and dp[i + 1][K - k - 1][D - d - i - 1]:
        ans.append(i + 1)
if sum(ans) + N == D:
    ans.append(N)
if len(ans) == 0:
    print(-1)
else:
    print(*ans)