#include <bits/stdc++.h>
using namespace std;
using ll = long long;

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

  ll N, M, K;
  cin >> N >> M >> K;

  vector<ll> v;
  for(ll i = N; i--;) {
    if(K >= i) {
      v.emplace_back(i);
      K -= i;
    }
  }

  vector<ll> ans(v);
  ranges::reverse(v);
  for(ll i = 0; i < N; i++) {
    if(!ranges::binary_search(v, i)) { ans.emplace_back(i); }
  }

  for(ll i = 0; i < N; i++) {
    if(ans[i] == N - 1) { ans[i] += M - N * (N - 1) / 2; }
  }

  for(auto &i : ans) { cout << i << "\n"; }
}