#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

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

    vector<ll> c;
    rep(i, N-1){
        c.eb(i);
        M -= i;
    }
    c.eb(M);

    int L = 0;
    while(K > 0){
        if(K >= N-1-L){
            K -= N-1-L;
            L++;
        }
        else{
            break;
        }
    }

    vector<ll> ans(N);
    rep(i, L){
        ans[N-1-i] = c[i];
    }
    rep(i, K){
        ans[i] = c[L+1+i];
    }
    ans[K] = c[L];
    rep(i, N-K-1-L){
        ans[K+1+i] = c[L+1+K+i];
    }

    rep(i, N) cout << ans[i] << '\n';
}