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

vector<int> solve(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;
    }
    
    int last = 0;
    for(int i=1;i<=K;i++){
        maxi = N * (N + 1) / 2 - (N - (K - i)) * (N - (K - i) + 1) / 2;
        
        int now = max(D - maxi, last + 1);
        res.push_back(now);
        
        D -= now;
        last = now;
    }
    
    return res;
}

int main(){
    int N, D, K;
    cin >> N >> D >> K;
 
    assert(1 <= N && N <= 100);
    assert(1 <= D && D <= 1000);
    assert(1 <= K && K <= 10);
    
    auto res = solve(N, D, K);
    for(int i=0;i<res.size();i++){
        if(i > 0){
            cout << " ";
        }
        cout << res[i];
    }
    cout << endl;
    
    return 0;
}