#include <bits/stdc++.h>
using namespace std;
using lli = long long;
lli n, k, s;
int main(void) {
  cin >> n >> k >> s;
  queue<lli> q;
  while (k--) q.push(s);
  while (q.size() < n) {
    if (s < 1e9)
      q.push(1e9);
    else
      q.push(0);
  }
  while (!q.empty()) {
    cout << q.front() << " ";
    q.pop();
  }
  cout << endl;
  return 0;
}
