# 辞書順最小なので前が重要
# Nの前K個を取る、Dがそれ未満ならアウト、Dが最大K個超でもアウト
# 前K個がD未満なら、最後を右に動かせるところまで動かす、の繰り返し

N, D, K = map(int, input().split())
if D < K*(K+1)//2 or D > (N*(N+1)//2-(N-K)*(N-K+1)//2):
    print(-1)
    exit()
last = N
s = K*(K+1)//2
ans = [a for a in range(1, K+1)]
for i in range(K-1, -1, -1):
    current = i+1
    gap = D - s
    if gap == 0:
        break
    elif gap >= last-current:
        s += (-current+last)
        ans[i] = last
        last -= 1
    else: 
        num = current + gap
        s += (-current+num)
        ans[i] = num
        last = num-1
    #print('last', last, 's', s, 'ans', ans)
print(*ans)