#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
 
using namespace std;
 
#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(long long i=(a);i<(b);++i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
 
#define MOD 1000000007

int main(){
  int n,d,k;
  cin>>n>>d>>k;
  int a;
  a=0;
  rep(i,1,k+1){
    a+=i;
  }
  if(a>d){
    cout << -1 << endl;
    return 0;
  }
  a=0;
  rep(i,n-k+1,n+1){
    a+=i;
  }
  if(a<d){
    cout << -1 << endl;
    return 0;
  }
  vector<int> v;
  rep(i,1,k+1){
    v.pb(i);
  }
  reverse(all(v));
  f:;
  for(;;){
    a=0;
    rep(i,0,v.sz){
      a+=v[i];
    }
    if(a==d){
      reverse(all(v));
      rep(i,0,v.sz){
        cout << v[i];
        if(i == v.sz-1){
          cout << endl;
        }
        else{
          cout << " ";
        }
      }
      return 0;
    }
    rep(i,0,v.sz){
      if(v[i] < n-i){
        v[i]++;
        goto f;
      }
    }
  }
  return 0;
}