#include <bits/stdc++.h>
using namespace std;
int n, k, s;
int nr;
int a[100000 + 1];
int main() {
  cin >> n >> k >> s;
  nr = (s == (int)(1e9) ? 2 : s + 1);
  if (k == n) {
    for (int i = 1; i <= n; i++) a[i] = s;
  } else if (k == 0) {
    for (int i = 1; i <= n; i++) a[i] = nr;
  } else if (k > 0) {
    int ant = 1;
    int cr = s - 1;
    for (int i = 1; i <= k + 1; i++) {
      a[i] = cr;
      swap(cr, ant);
    }
    for (int i = k + 2; i <= n; i++) a[i] = nr;
  }
  for (int i = 1; i <= n; i++) cout << a[i] << " ";
  cout << "\n";
  return 0;
}
