#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
void solve() {
  int n, k, s;
  cin >> n >> k >> s;
  vector<int> re(n, s + 1);
  for (int i = 0; i < k; i++) {
    re[i] = s;
  }
  for (int i = 0; i < n; i++) {
    if (i) cout << " ";
    cout << re[i];
  }
  cout << endl;
}
int main() {
  int T = 1;
  while (T--) {
    solve();
  }
  return 0;
}
