from collections import deque

N, M, K = map(int, input().split())

lef = []
rig = []

for i in reversed(range(N)):
    if K >= i:
        K -= i
        lef.append(i)
    else:
        rig.append(i)

ans = lef + rig[::-1]

ans[ans.index(N - 1)] += M - (N * (N - 1) // 2)

print(ans)