import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


int N, D, K;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      D = readInt();
      K = readInt();
      auto dp = new bool[][][](D + 1, K + 1, N + 2);
      dp[0][0][] = true;
      foreach (d; 1 .. D + 1) foreach (k; 1 .. K + 1) foreach_reverse (n; 1 .. N + 1) {
        dp[d][k][n] = dp[d][k][n + 1];
        if (d >= n && k >= 1) {
          dp[d][k][n] |= dp[d - n][k - 1][n + 1];
        }
      }
      if (dp[D][K][1]) {
        int[] ans;
        for (int d = D, k = K, n = 1; !(d == 0 && k == 0); ) {
          bool found;
          foreach (x; n .. N + 1) {
            if (d >= x && k >= 1 && dp[d - x][k - 1][x + 1]) {
              ans ~= x;
              d -= x;
              k -= 1;
              n = x + 1;
              found = true;
              break;
            }
          }
          assert(found);
        }
        writeln(ans.to!string.replaceAll(regex(`[\[\],]`), ""));
      } else {
        writeln(-1);
      }
    }
  } catch (EOFException e) {
  }
}