#include <bits/stdc++.h>
#pragma GCC optimize("O3,no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx")
using namespace std;
template <class T>
using Graph = vector<vector<T>>;
const long double pi = M_PI;
const int64_t MOD = 1000000007;
const int64_t INF = 1LL << 62;
int64_t Floor(int64_t a, int64_t b) { return (a - (a % b)) / b; }
template <class T>
inline bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline T Gcd(T a, T b) {
  T c;
  while (b) {
    c = b;
    b = a % b;
    a = c;
  }
  return a;
}
int64_t Lcm(int64_t a, int64_t b) {
  if (a < b) {
    swap(a, b);
  }
  return a / Gcd(a, b) * b;
}
template <typename T>
T modpow(T a, T n, T mod) {
  T ret = 1;
  if (mod == 1) {
    while (n > 0) {
      if (n & 1) {
        ret = ret * a;
      }
      a = a * a;
      n >>= 1;
    }
  } else {
    while (n > 0) {
      if (n & 1) {
        ret = ret * a % mod;
      }
      a = a * a % mod;
      n >>= 1;
    }
  }
  return ret;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int64_t n, k, s;
  cin >> n >> k >> s;
  vector<int64_t> ans;
  for (int i = 0; i < n; i++) {
    if (i < k) {
      ans.push_back(s);
    } else {
      ans.push_back(1000000000);
    }
  }
  for (int i = 0; i < n - 1; i++) {
    cout << ans[i] << ' ';
  }
  cout << ans[n - 1] << endl;
  return 0;
}
