n, d, k = map(int, input().split())

ans = []
now = 1

while k > 0:
    for i in range(now, n - k + 2):
        amari = d - i
        min_sum = (k - 1) * (2 * (i + 1) + (k - 2)) // 2
        max_sum = (k - 1) * (2 * n - (k - 2)) // 2

        if min_sum <= amari <= max_sum:
            ans.append(i)
            d -= i
            k -= 1
            now = i + 1
            break
    else:
        print(-1)
        exit()

print(*ans)