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

    dp = [[{} for k in range(K + 2)] for i in range(N + 1)]

    # dp[i][k][d] = i 番目までで k 個買って d 円使う組み合わせ
    dp[0][0][0] = []

    for i in range(N):
        for k in range(K+1):
            for d in dp[i][k]:
                if d not in dp[i + 1][k]:
                    dp[i + 1][k][d] = dp[i][k][d]
                if k < K and d + i not in dp[i + 1][k + 1]:
                    dp[i + 1][k + 1][d + i] = dp[i][k][d] + [i]

    if D in dp[N][K]:
        print(' '.join(str(i + 1) for i in dp[N][K][D]))
    else:
        print(-1)


if __name__ == '__main__':
    solve()