#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for (int i=(int)(b); i<(int)(e); i++)
#define ALL(x) (x).begin(), (x).end()

const double PI = acos(-1);

int n, d, k;
int dp[100+1][10+1][1000+1];

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  
  cin >> n >> d >> k;

  dp[n][1][n] = 1;
  dp[n][0][0] = 1;

  for (int i = n-1; i >= 0; i--) {
    for (int j = 0; j <= k; j++) {
      for (int l = 0; l <= d; l++) {
        dp[i][j][l] = dp[i+1][j][l];
        if (j-1 >= 0 && l-i >= 0)
          dp[i][j][l] |= dp[i+1][j-1][l-i];
      }
    }
  }

  if (!dp[1][k][d]) {
    cout << -1 << endl;
  } else {
    vector<int> ret;
    for (int i = 1; i < n; i++) {
      if (dp[i+1][k-1][d-i]) {
        ret.push_back(i);
        --k;
        d -= i;
      }
    }
    if (k > 0)
      ret.push_back(n);
    for (auto &x: ret)
      cout << x << " ";
    cout << endl;
  }
  return 0;
}