#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; ll m, k; cin >> n >> m >> k;
  vector<ll> b(n);
  iota(ALL(b), 0);
  b.back() += m - (n - 1LL) * n / 2;
  vector<ll> a;
  for (int i = n - 1; i >= 0; --i) {
    if (k > i) {
      k -= i;
      a.emplace_back(b.back());
      b.pop_back();
    } else {
      a.emplace_back(b[k]);
      b.erase(b.begin() + k);
      break;
    }
  }
  for (ll bi : b) a.emplace_back(bi);
  REP(i, n) cout << a[i] << '\n';
  return 0;
}