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

    L = list(range(N+1))

    last = 0
    ans = []
    while K:
        can = sum(range((N + 1) - (K - 1), N + 1))
        last = max(last + 1, D - can)
        ans.append(last)
        D -= last
        K -= 1
    if D != 0 or can == 0:
        print(-1)
    else:
        print(' '.join(map(str, ans)))


if __name__ == '__main__':
    solve()