#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;

int N, D, K;
vector<int> ans;

bool solve(int i, int k, int d){
    if(d==0) return true;
    if(N<i) return false;
    
    if(d<=i+N*(N+1)/2-(N-k+1)*(N-k+2)/2){
        ans.push_back(i);
        k--; d-=i;
    }

    solve(i+1, k, d);
}

int main(){
    cin >> N >> D >> K;

    if(!solve(1, K, D) || D < K*(K+1)/2){
        cout << -1;
    }else{
        for(int it:ans) cout << it << ' ';
    }

    cout << endl;
}