import sys
sys.setrecursionlimit(10000)

def dfs(array,i,d,k):
    if d == D and k == K: return array
    if i > N or d > D or d+i > D or k > K: return False
    res = dfs(array+[i],i+1,d+i,k+1)
    if res: return res
    res = dfs(array,i+1,d,k)
    if res: return res
    
N,D,K = map(int,raw_input().split())
print " ".join(map(str,dfs([],1,0,0)))