#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll)INF*INF
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(int i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef vector<pii> vp;

int gcd(int a, int b){
    if(b==0) return a;
    return gcd(b,a%b);
}
int lcm(int a, int b){
    return a/gcd(a,b)*b;
}

int n,d,k;
vi ans;
int memo[105][15][1005] = {};
bool dfs(int i, int num, int sum){
    if(memo[i][num][sum] == 1)return true;
    if(memo[i][num][sum] == -1)return false;
    if(sum == d && num == k){
        //cout << "!" << endl;
        memo[i][num][sum] = 1;
        return true;
    }
    if(sum > d || i > n || num > k){
        memo[i][num][sum] = -1;
        return false;
    }
    //cout << " " << i << " " << num << " " << sum << endl;
    if(dfs(i+1,num+1,sum+i)){
        ans.push_back(i);
        memo[i][num][sum] = 1;
        return true;
    }
    if(dfs(i+1,num,sum)){
        memo[i][num][sum] = 1;
        return true;
    }
    memo[i][num][sum] = -1;
    return false;
}


signed main(void) {
    cin >> n >> d >> k;
    rep(i,n){
        if(dfs(i+1,0,0))break;
    }
    if(ans.size()){
        sort(all(ans));
        rep(i,ans.size()){
            if(i)cout << " ";
            cout << ans[i];
        }
        cout << endl;
    }else{
        cout << -1 << endl;
    }
}