N,D,K=map(int,input().split())

def calc(l,r,K):
    return (l+(l+K-1))*K//2,(r+(r-K+1))*K//2

ANS=[0]

for tests in range(K):
    SUM=sum(ANS)

    for j in range(ANS[-1]+1,N+1):
        if N-(j+1)+1<K-len(ANS):
            continue

        MIN,MAX=calc(j+1,N,K-len(ANS))

        if MIN<=D-(SUM+j)<=MAX:
            ANS.append(j)
            break

if len(ANS)==K+1 and sum(ANS)==D:
    print(*ANS[1:])
else:
    print(-1)