#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using p = pair<ll, ll>;
const ll INF = (ll)1e9;
void a() {
  int h;
  int w;
  int n;
  cin >> h >> w >> n;
  int max = std::max(h, w);
  int min = std::min(h, w);
  for (int i = 1; i <= min; i++) {
    if (max * i >= n) {
      cout << i;
      return;
    }
  }
  cout << 0;
}
void b() {
  int n;
  cin >> n;
  auto st = vector<p>(n, p(0, 0));
  for (int i = 0; i < n; i++) {
    int x, l;
    cin >> x >> l;
    st[i] = make_pair(x + l, x - l);
  }
  sort(st.begin(), st.end());
  int ans = 0, t = -INF;
  for (int i = 0; i < n; i++) {
    if (t <= st[i].second) {
      ans++;
      t = st[i].first;
    }
  }
  cout << ans;
}
void c() {
  ll n, k, s;
  cin >> n >> k >> s;
  for (int i = 1; i <= k; i++) {
    cout << s << " ";
  }
  for (int i = k + 1; i <= n; i++) {
    cout << 1 << " ";
  }
}
int main() {
  c();
  return 0;
}
