def min(a,b); a < b ? a : b; end
N, D, K = gets.split.map(&:to_i)

if K > N
  puts -1
  exit
end

ANS = Array.new(K){|i| K - i }
rest = K.times.inject(D) do |d, i|
  r = K - i
  sum = r * (r + 1) / 2
  if sum > d
    ANS.clear
    ANS << -1
    break 1
  else
    ANS[i] += min(d - sum, N - K)
    d - ANS[i]
  end
end

if rest > 0
  puts -1
else
  puts ANS.reverse.join(' ')
end