n,m,k = map(int,input().split())
ans = []
for i in range(n):
    if i == n-1:
        ans.append(m-(i-1)*i//2)
    else:
        ans.append(i)
N = n-1
cnt = 0
goukei = 0
while goukei < k:
    if goukei + N > k:
        break
    goukei += N
    N -= 1
    cnt += 1
if cnt == 0:
    ll = []
else:
    ll = ans[-cnt::]
ll.sort(reverse = True)
lll = ans[:n-cnt]
for j in range(k - goukei):
    lll[-(j+1)] ,lll[-(j + 2)] = lll[-(j + 2)]  ,lll[-(j+1)]
ans = ll + lll
for i in range(n):
    print(ans[i])