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

from functools import lru_cache
@lru_cache(maxsize=None)
def search(now,pricesum,nextprice,rest):
    if rest==0 and pricesum==D:
        print(*now)
        exit()

    for i in range(nextprice,N+1):
        if pricesum+i<=D:
            search(now+(i,),pricesum+i,i+1,rest-1)

search(tuple(),0,1,K)
print(-1)