#include <bits/stdc++.h>
using namespace std;

template< class T1, class T2 >
int upmax( T1 &x, T2 v ){
  if( x < v ){
    x = v;
    return 1;
  }
  return 0;
}

signed main(){
  int N, D, K; cin >> N >> D >> K;
  vector< vector< vector< int > > > dp( N + 2, vector< vector< int > >( D + 1, vector< int >( K + 1 ) ) );
  vector< vector< vector< int > > > ds( N + 2, vector< vector< int > >( D + 1, vector< int >( K + 1, -1 ) ) );
  dp[ 1 ][ 0 ][ 0 ] = 1;
  for( int i = 1; i <= N; ++i )
    for( int j = 0; j <= D; ++j )
      for( int k = 0; k <= K; ++k ){
        if( upmax( dp[ i + 1 ][ j ][ k ], dp[ i ][ j ][ k ] ) )
          ds[ i + 1 ][ j ][ k ] = -2; // not choosing i
        if( j + i <= D and k + 1 <= K and upmax( dp[ i + 1 ][ j + i ][ k + 1 ], dp[ i ][ j ][ k ] ) )
          ds[ i + 1 ][ j + i ][ k + 1 ] = i;
      }
  if( not dp[ N + 1 ][ D ][ K ] )
    cout << -1 << endl, exit( 0 );
  stack< int > ans;
  for( int i = N + 1, j = D, k = K; i > 1; ){
    int u = ds[ i ][ j ][ k ];
    if( u == -2 )
      --i;
    else
      ans.emplace( i - 1 ),
      j -= i - 1,
      --i,
      --k;
  }
  for( ; not ans.empty(); ans.pop() )
    cout << ans.top() << " \n"[ ans.size() == 1 ];
  return 0;
}