from collections import deque
N, M, K = map(int, input().split())
d = deque()
for i in range(N):
    if i<N-1:
        d.append(i+1)
        M -= i+1
    else:
        d.append(M)
if M<N:
    exit(print(0))

res = [0]*N
for i in range(N):
    n = N-i-1
    if K>=n:
        v = d.popleft()
        res[-1-i] = v
        K -= n
    else:
        v = d.pop()
        res[-1-i] = v
if K==0:
    print(*res, sep='\n')
else:
    print(0)