#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)

void solve() {
    ll n, m, k;
    cin >> n >> m >> k;
    vector<ll> a(n);
    iota(a.begin(), a.end(), 0);
    a[n-1] += m - n * (n - 1) / 2;
    ll p = 0, sum = 0;
    vector<ll> ans;
    for(ll i = n-1; i >= 1; i--) {
        if(sum + i <= k) {
            sum += i;
            ans.push_back(a[i]);
        } else {
            p = i;
            break;
        }
    }
    for(ll i = p; i >= 1; i--) {
        if(sum == k) break;
        sum++;
        swap(a[i], a[i-1]);
    }
    rep(i, 0, p+1) ans.push_back(a[i]);
    rep(i, 0, n) cout << ans[i] << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}