n,m,k=map(int,input().split())
k=(n*(n-1))//2-k
a=list(range(n-1))
a+=[m-sum(a)]
a=a[::-1]
from collections import deque
l=deque(a)
r=deque([])
for i in range(n-1):
  if k-(n-1-i)>=0:
    r.appendleft(l.popleft())
    k-=n-1-i
a=[]
while len(l)>0:
  a+=[l.popleft()]
while len(r)>0:
  a+=[r.popleft()]
for i in range(n-1):
  if a[i]>a[i+1] and k>0:
    a[i],a[i+1]=a[i+1],a[i]
    k-=1
print(*a,sep="\n")