n,d,k=map(int,input().split())
def f(x,cnt,now):
    if cnt<k-1:
        if (d-now)//(k-cnt)>=n:
            return
    if cnt==k:
        if now==d:
            print(*x)
            exit()
        return
    for i in range(x[-1]+1,n+1):
        if now+i>d:
            continue
        f(x+[i],cnt+1,now+i)
for i in range(1,n+1):
    f([i],1,i)
print(-1)