#include <bits/stdc++.h>
using namespace std;
long long modinv(long long a, long long m) {
  long long b = m, u = 1, v = 0;
  while (b) {
    long long t = a / b;
    a -= t * b;
    swap(a, b);
    u -= t * v;
    swap(u, v);
  }
  u %= m;
  if (u < 0) u += m;
  return u;
}
long long mod = 1e9 + 7;
signed main() {
  int n, k, s;
  cin >> n >> k >> s;
  for (int i = 0; i < k; i++) {
    cout << s << " ";
  }
  for (int i = k; i < n; i++) {
    cout << s + 1 << " ";
  }
}
