n, m, k = map(int, input().split())


ans = [i for i in range(n)]
ans[-1] = m - sum(ans[0:-1])

if True:
    res = []
    for i in reversed(range(n)):
        if k == 0:
            nokori = ans[0:i + 1]
            break
        if k >= i:
            res.append(ans[i])
            k -= i
        else:
            nokori = ans[0:i + 1]
            break
    
    for i in range(k):
        nokori[i + 1], nokori[i] = nokori[i], nokori[i + 1]
    
    res = res + nokori
    for r in res:
        print(r)