import std.algorithm, std.conv, std.range, std.stdio, std.string; void main() { auto rd = readln.split.to!(int[]), n = rd[0], d = rd[1], k = rd[2]; auto dp = new int[][][][](n+1, k+1, d+1); foreach (i; 1..n+1) dp[i][0][0] = [0]; foreach (i; 1..n+1) foreach (j; 1..k+1) foreach (e; 1..d+1) { auto c1 = e >= i ? dp[i-1][j-1][e-i] ~ i : [i]; auto c2 = dp[i-1][j][e]; if (c1.front == 0) { if (!c2.empty) dp[i][j][e] = min(c1, c2); else dp[i][j][e] = c1; } else { if (!c2.empty) dp[i][j][e] = c2; } } auto r = dp[n][k][d]; if (r.empty) writeln(-1); else writeln(r.drop(1).to!(string[]).join(" ")); }