#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int n, d, k;
    cin >> n >> d >> k;

    int ans = -1;
    if(n < k || k*(k+1)/2 > d || n*(n+1)/2 - (n-k)*(n-k+1)/2 < d){
        cout << ans << endl;
        return 0;
    } 

    int f[n+1] = {};
    int sum = 0;
    srep(i,1,k+1){
        f[i] = 1;
        sum += i;
    }

    drep(i,k+1){
        int flag = 0;
        srep(j,i+1,n+1){
            if(f[j])break;
            if(sum == d){
                flag = 1;
                break;
            }
            f[j-1] = 0;
            f[j] = 1;
            sum++;
        }
        if(flag)break;
    }
    int cnt = 0;
    rep(i,n+1){
        if(f[i]){
            cnt++;
            cout << i;
            if(cnt < k)cout << ' ';
            else cout << endl;
        }
    }
    return 0;
}