#sになるのがちょうどk個
n,k,s=map(int,input().split())
ans=0
n_max=10**5
ans=[0]*n
moto=[]
detarame=10**5-1
if s<n:
    ans = [n]*k +[n+1]*(n-k)
    print(ans)
else:
    flag=0
    remain=s
    for i in range(n):
        moto.append(min(n_max,remain))
        if moto[-1]<n_max:
            flag=1
            break
        remain-=moto[-1]
    nagasa=len(moto)
    for i in range(nagasa+k-1):
        ans[i]=moto[i%nagasa]
    for i in range(nagasa+k-1,n):
        ans[i]=detarame
    print(ans)