/* -*- coding: utf-8 -*-
 *
 * 1619.cc:  No.1619 Coccinellidae - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100000;

/* typedef */

typedef long long ll;

/* global variables */

ll as[MAX_N], ps[MAX_N];
bool used[MAX_N];

/* subroutines */

/* main */

int main() {
  int n;
  ll m, k;
  scanf("%d%lld%lld", &n, &m, &k);

  ll s = (ll)n * (n - 1) / 2;
  ll a0 = (m - s) / n;

  for (int i = 0; i < n; i++) as[i] = a0 + i;
  as[n - 1] += m - (s + (ll)a0 * n);
  //for (int i = 0; i < n; i++) printf("%lld ", as[i]); putchar('\n');

  int l = 0;
  for (int i = n - 1; i >= 0; i--)
    if (k >= i) {
      ps[l++] = i;
      used[i] = true;
      k -= i;
    }

  for (int i = 0; i < n; i++)
    if (! used[i]) ps[l++] = i;

  for (int i = 0; i < n; i++) printf("%lld\n", as[ps[i]]);
  return 0;
}