import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**16
md = 998244353
# md = 10**9+7

from collections import deque

n, m, k = LI()
diff = m-n*(n-1)//2
q, r = divmod(diff, n)
aa = list(range(q, q+n))
for i in range(n-1, n-1-r, -1):
    aa[i] += 1

aa = deque(aa)
ans = []
while aa:
    if len(aa)-1 <= k:
        ans.append(aa.pop())
        k -= len(aa)
    else:
        ans.append(aa.popleft())

print(*ans,sep="\n")