#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <set>
#include <map>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)

typedef long long ll;

template<class T> constexpr auto chmin(T& x, T a) { x = min(x, a); }

vector<int> dp[105][1101][15];

const vector<int> def = {99,99,99,99};

ostream& operator << (ostream& ost, vector<int>& v) {
  if(v == def) { ost << -1; }
  else {
    rep(i, v.size()) {
      if(i) cout << " ";
      ost << v[i];
    }
  }
  return ost;
}

int main() {

  int N, D, K; cin >> N >> D >> K;

  rep(i, 105) rep(j, 1101) rep(k, 15) { dp[i][j][k] = def; }

  dp[0][0][0] = {};
  rep(i, N+1) {
    rep(j, 1001) {
      rep(k, 11) {
        if(dp[i][j][k] != def) {
          vector<int> nvec = dp[i][j][k]; nvec.push_back(i+1);
          chmin(dp[i+1][j][k], dp[i][j][k]);
          chmin(dp[i+1][j+i+1][k+1], nvec);
//          cout << dp[i+1][j+i+1][k+1] << endl;
        }
      }
    }
  }

  cout << dp[N][D][K] << endl;

  return 0;
}