#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using Graph = vector<vector<int>>;
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
int main() {
  unsigned long long n, k, s;
  cin >> n >> k >> s;
  vector<unsigned long long> a(n, 2 * s);
  if (k != 0) {
    for (int i = 0; i < k; i++) a[i] = s;
  }
  for (int i = 0; i < n; i++) cout << a[i] << ' ';
}
