N, D, K = map(int, input().split(" "))

def solver(n, d, k, ans):
    global N
    if k == 0:
        if d == 0:
            return ans
        else:
            return False
    tmp = []
    for i in range(n+1, N+1):
        if d >= i:
            _tmp = solver(i,d-i,k-1,ans+[i])
            if _tmp:
                tmp.append(_tmp)
    if tmp == []:
        return False
    else:
        sorted(tmp)
        return tmp[0]

ans = []
for i in range(1, N+1):
    tmp = solver(i, D-i, K-1, [i])
    if tmp:
        ans.append(tmp)

if len(ans) == 0:
    print(-1)
else:
    sorted(ans)
    print(" ".join(map(str, ans[0])))