#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;

template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}

signed main(){
    int N;ll M,K;cin>>N>>M>>K;

    vector<ll> P(N,1);
    rep(i,N){
        int add=N-1-i;
        if(add<=K){
            P[i]=N-i;
            K-=add;
        }
    }

    assert(K==0);

    int mx=1;
    for(int i=N-1;i>=0;i--){
        if(P[i]>1){
            P[i]=mx+1;
            mx++;
        }
    }

    ll S=0;
    rep(i,N) S+=P[i];

    ll add=M-S;
    *max_element(ALL(P))+=add;
    for(auto &x:P) cout<<x<<endl;
    return 0;
}