#include <bits/stdc++.h>
using namespace std;
template <typename T>
ostream &operator<<(ostream &os, vector<T> &v) {
  os << "{";
  for (int i = 0; i < (int)(v.size()); ++i)
    os << v[i] << (i == (int)v.size() - 1 ? "" : ", ");
  os << "}";
  return os;
}
template <typename T>
T dup(T x, T y) {
  return (x + y - 1) / y;
};
template <typename A, size_t N, typename T>
inline void arrayFill(A (&array)[N], const T &val) {
  std::fill((T *)array, (T *)(array + N), val);
}
struct in {
  const size_t n = 0;
  in() = default;
  in(size_t n) : n(n){};
  template <typename T>
  operator T() {
    T ret;
    cin >> ret;
    return ret;
  }
  template <typename T>
  operator vector<T>() {
    assert(n != 0);
    vector<T> ret(n);
    for (auto &x : ret) cin >> x;
    return ret;
  }
};
using ll = int64_t;
using vint = vector<int32_t>;
using vvint = vector<vint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pint = pair<int32_t, int32_t>;
using vpint = vector<pint>;
using pll = pair<ll, ll>;
using setint = set<int32_t>;
using setstr = set<string>;
using qint = queue<int32_t>;
using qpint = queue<pint>;
constexpr std::int32_t INF = 1001001001;
constexpr std::int64_t LINF = 1001001001001001001;
void Main() {
  constexpr ll a = 1000000000;
  ll n = in(), k = in(), s = in();
  vll ans;
  ans.reserve(n);
  for (int i = 0; i < (int)(k); ++i) ans.push_back(s);
  for (int i = 0; i < (int)(n - k); ++i) ans.push_back(n == a ? a - 1 : a);
  for (int i = 0; i < (int)(n); ++i) cout << ans[i] << endl;
}
signed main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  std::cout << std::fixed << std::setprecision(15);
  Main();
  return 0;
}
