from collections import defaultdict


def solve(N, D, K):

    # dp[n][k][d] = n番目までで k 個買って d 円使う組み合わせを作れるか
    dp = [[[False for d in range(D + 1)] for k in range(K + 2)] for i in range(N + 1)]
    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
    src[0][0][0] = (None, None, None)

    for n in range(N):
        for k in range(K, -1, -1):
            for d in range(D + 1):
                if not dp[n][k][d]:
                    continue
                if not n + 1 < len(dp):
                    continue

                dp[n + 1][k][d] = True
                src[n + 1][k][d] = n, k, d
                if n + 1 < len(dp) and k + 1 < len(dp[0]) and d + n + 1 < len(dp[0][0]):
                    dp[n + 1][k + 1][d + n + 1] = True
                    src[n + 1][k + 1][d + n + 1] = n, k, d

    if not src[N][K][D]:
        return [-1]

    ans = []
    n, k, d = N, K, D
    while k:
        pn, pk, pd = src[n][k][d]
        if pd != d:
            ans.append(n)
        n, k, d = pn, pk, pd
    return list(sorted(ans))


def can_use(x, n, d, k):
    if n - k + 1 < x:
        return False

    low, high = 0, 0
    for i in range(0, k):
        low += x + i
        high += n - i

    return low <= d <= high


def solve2(N, D, K):
    n, d, k = N, D, K
    ans = []

    if not can_use(1, n, d, k):
        return [-1]

    for i in range(1, n + 1):
        if can_use(i + 1, n, d - i, k - 1):
            ans.append(i)
            d -= i
            k -= 1

    if sum(ans) == D and len(ans) == K:
        return ans
    else:
        return [-1]


def main():
    n, d, k = map(int, input().split())
    print(*solve2(n, d, k), sep=" ")


if __name__ == '__main__':
    main()