#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigmod(T p, T e, T M) {
  long long ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int s, n, k;
  cin >> n >> k >> s;
  for (int i = 1; i <= k; i++) {
    cout << s << " ";
  }
  for (int i = k + 1; i <= n; i++) cout << s - 1 << " ";
  return 0;
}
