#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    ll n, m, k; cin >> n >> m >> k;
    vector<ll> p(n);
    for(int i = 0; i < n-1; i++) p[i] = i;
    p[n-1] = m-accumulate(p.begin(), p.end(), 0ll);
    vector<ll> ans(n);
    set<int> st;
    for(int i = 0; i < n; i++) st.insert(i);
    ll rem = k;
    for(int i = 0; i < n; i++){
        if(rem >= (n-i-1)){
            // 残りの一番最後
            auto pt = st.end(); pt--;
            int idx = *pt;
            ans[idx] = p[i];
            rem -= (n-i-1);
            st.erase(idx);
        }else if(rem == 0){
            int idx = *st.begin();
            ans[idx] = p[i];
            st.erase(idx);
        }else{
            vector<int> v;
            for(int x: st) v.push_back(x);
            int idx = v[rem];
            ans[idx] = p[i];
            st.erase(idx);
            rem = 0;
        }
    }
    for(int i = 0; i < n; i++) cout << ans[i] << endl;
}