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

vector<int> greedy_solver(int N, int D, int K){
    vector<int> res;
    
    if(K > N){
        res.push_back(-1);
        return res;
    }
    
    int mini = K * (K + 1) / 2;
    int maxi = N * (N + 1) / 2 - (N - K) * (N - K + 1) / 2;
    if(D < mini || maxi < D){
        res.push_back(-1);
        return res;
    }
    
    res.resize(K);
    for(int i=0;i<K-1;i++){
        res[i] = i + 1;
        D -= i + 1;
    }
    res[K-1] = D;
    
    int lim = N;
    for(int i=K-1;i>=0;i--){
        if(res[i] > lim){
            res[i-1] += res[i] - lim;
            res[i] = lim;
            
            --lim;
        } else {
            break;
        }
    }
    
    return res;
}

int main(){
    int N, D, K;
    cin >> N >> D >> K;
    
    auto res = greedy_solver(N, D, K);
    for(int i=0;i<res.size();i++){
        if(i > 0){
            cout << " ";
        }
        cout << res[i];
    }
    cout << endl;
    
    return 0;
}