from collections import deque
n,m,k = map(int,input().split())
ans = [i for i in range(n-1)]
ans.append(m-sum(ans))
ans2 = deque(ans)

now = 0
while True:
    if n-1-now < k:
        ans2.appendleft(ans2.pop())
        k -= n-1-now
        now += 1
    else:
        ans = []
        for i in range(n):
            ans.append(ans2.popleft())
        ans.insert(-k,ans.pop())
        for i in ans:
            print(i)
        exit()