// includes
#include <bits/stdc++.h>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}

bool dp[101][11][1001];

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n, d, k;
  cin >> n >> d >> k;
  dp[0][0][0] = true;
  for(int i = n; i >= 1; i--){
    for(int j = 0; j <= k; j++){
      for(int l = 0; l <= d; l++){
        dp[n-i+1][j][l] = dp[n-i][j][l];
        if(j>0&&l-i>=0)dp[n-i+1][j][l] |= dp[n-i][j-1][l-i];
      }
    }
  }
  if(!dp[n][k][d])cout << -1 << endl;
  else{
    vector<int> res;
    for(int i = 1; i <= n; i++){
      if(k>0&&d-i>=0&&dp[n-i][k-1][d-i]){
        res.pb(i);
        k--;
        d -= i;
      }
    }
    rep(i, sz(res))cout << res[i] << "\n "[i + 1 != sz(res)];
  }
	return 0;
}