#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <functional>

int sigma(int begin, int end, std::function<int(int)> func){
    if(begin>end) std::swap(begin, end);
    int ans=0;
    for(int i=begin; i<=end; ++i){
        ans+=func(i);
    }
    return ans;
}

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    
    //input
    int n, d, k;
    std::cin >> n >> d >> k;

    //solve
    auto func = [](int x){return x;};
    if(d-sigma(1, k-1, func)<k || sigma(n-k+1, n, func)<d){
        std::cout << -1;
    }else{
        std::vector<int> value(k);
        for(int i=k-1; i>=0; --i){
            int rest = d-sigma(1, i, func);
            if(rest<=n-k+i){
                for(int j=0; j<i; ++j){
                    value[j]=j+1;
                }
                value[i]=rest;
                break;
            }else{
                value[i]=n-k+i+1;
                d-=n-k+i+1;
            }
        }
        for(auto it : value){
            std::cout << it << " ";
        }
    }
    std::cout << "\n";

    return 0;
}