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

#define rep(i, n) for(ll i = 0; i < n; i++)
#define rep2(i, m, n) for(ll i = m; i <= n; i++)
#define rrep(i, m, n) for(ll i = m; i >= n; i--)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define MAX(x) *max_element(all(x))
#define MIN(x) *min_element(all(x))
#define SZ(a) ((ll)(a).size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
const int dx[4] = { -1, 1, 0, 0 };
const int dy[4] = { 0, 0, 1, -1 };
const int inf = 1e9 + 1;
const ll INF = 1e18;
const double pi = acos(-1);

using Graph = vector<vector<ll>>;


//typedef atcoder::modint998244353 mint;
//typedef atcoder::modint1000000007 mint;


int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll n, m, k; cin >> n >> m >> k;
    vector<ll> p(n);
    rep(i, n) {
        if (i < n - 1) {
            p[i] = i;
            m -= i;
        }
        else {
            p[i] = m;
        }
    }
    
    vector<ll> res(n, -1);
    int index;
    rep(i, n) {
        index = n - 1 - i;
        if (k >= n - i - 1) {
            res[i] = p[n - 1 - i];
            k -= n - i - 1;
        }
        else {
            res[n - 1 - k] = p[n - 1 - i];
            break;
        }
    }

    rrep(i, n - 1, 0) {
        if (res[i] == -1) {
            res[i] = p[index - 1];
            index--;
        }
    }
    rep(i, n) {
        cout << res[i] << endl;
    }
}