#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e8;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;

int n, d, k;
stack<int> st;
int dp[102][11][1001];
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n >> d >> k;
  FOR(i, 0, n+1){
    FOR(l, 1, d+1) dp[i][0][l] = -1;
    FOR(j, 0, k+1) dp[i][j][0] = 0;
  }
  FOR(j, 0, k+1) FOR(l, 0, d+1) dp[n+1][j][l] = -1;
  dp[n+1][0][0] = 0;
  FORR(i, n, 1){
    FORR(j, k, 1){
      FOR(m, 0, d+1){
        if(m - i >= 0 && dp[i + 1][j - 1][m - i] >= 0){
          dp[i][j][m] = i;
        }else{
          dp[i][j][m] = dp[i + 1][j][m];
        }
      }
    }
  }
  vi a;
  if(dp[1][k][d] >= 0){
    int b = 1;
    vi a;
    while(dp[b][k][d] > 0){
      int t = dp[b][k][d];
      a.pb(t);
      b = t + 1;
      k--;
      d -= t;
    }
    cout << join(a) << endl;
  }else{
    cout << -1 << endl;
  }
}