def solve():
    N, D, K = list(map(int, input().split()))

    dp = [[[False for d in range(D+1)] for k in range(K + 2)] for i in range(N + 1)]
    # dp[i][k][d] = i 番目までで k 個買って d 円使う組み合わせを作れるか
    src = [[[None for d in range(D+1)] for k in range(K + 2)] for i in range(N + 1)]

    dp[0][0][0] = True

    for i in range(N):
        for k in range(K, -1, -1):
            for d in range(D + 1):
                if dp[i][k][d]:
                    dp[i + 1][k][d] = True
                    src[i + 1][k][d] = (i, k, d)
                    if d + i + 1 <= D:
                        dp[i + 1][k + 1][d + i + 1] = True
                        src[i + 1][k + 1][d + i + 1] = (i, k, d)

    if dp[N][K][D]:
        r = []
        i, k, d = N, K, D
        while k:
            pi, pk, pd = src[i][k][d]
            if pd != d:
                r.append(i)
            i, k, d = pi, pk, pd
        print(' '.join(str(i) for i in r[::-1]))
    else:
        print(-1)


if __name__ == '__main__':
    solve()