import std.algorithm, std.array, std.container, std.range; import std.string, std.conv; import std.math, std.bigint, std.bitmanip, std.random; import std.stdio, std.typecons; void main() { auto rd = readln.split.map!(to!int); auto n = rd[0], d = rd[1], k = rd[2]; if (d < comSum(k)) { writeln(-1); } else { auto ai = iota(k).map!(to!int).map!("a + 1").array; foreach_reverse (i; 0..k) { if (ai.sum >= d) break; if (ai.sum < d) { auto b = n - k + 1 + i; auto c = d - (comSum(i) + comSum(k - i - 2) + (b + 1) * (k - i - 1)); ai[i] = min(b, c); } } writeln(ai.map!(to!string).join(' ')); } } int comSum(int k) { return k * (k + 1) / 2; }