#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T>
using V = vector<T>;
const ll inf = (1e18);
const ll mod = 1000000007;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }
struct __INIT {
  __INIT() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);
  }
} __init;
template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
int main() {
  ll n, k, s;
  cin >> n >> k >> s;
  V<ll> a(n);
  if (k == 0) {
    if (s == 1000000000) {
      for (int i = 0; i < n; i++) {
        cout << 1000000000 - 1 << " ";
      }
    } else {
      for (int i = 0; i < n; i++) {
        cout << 1000000000 << " ";
      }
    }
    cout << endl;
    return 0;
  }
  int j = 0;
  while (k != 1) {
    a[j] = s;
    j++;
    k--;
  }
  if (k == 1 && j == n - 1) {
    a[j] = s;
    for (int i = 0; i < n; i++) cout << a[i] << " ";
    cout << endl;
    return 0;
  }
  ll d = s / (n - j);
  ll t = s % (n - j);
  for (int i = j; i < n; i++) a[i] = d;
  a[n - 1] = d + t;
  for (int i = 0; i < n; i++) cout << a[i] << " ";
  cout << endl;
}
