N,D,K = map(int,input().split())
DP = [[0] * (D+1) for i in range(K)]
for n in range(1,N+1):
    for k in reversed(range(K-1)):
        for i in range(D+1):
            if  i+n <= D and DP[k][i]!=0:
                DP[k+1][i+n]=n
    if n <= D:
        DP[0][n] = n
if DP[K-1][D]==0:
    print(-1)
    exit()
else:
    ANS = []
    temp = 0
    for i in reversed(range(K)):
        ANS.append(DP[i][D-temp])
        temp += DP[i][D-temp]

    ANS.sort()
    print(*ANS)