#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return abs(a * b) / gcd(a, b); }
std::vector<bool> IsPrime;
void sieve(size_t max) {
  if (max + 1 > IsPrime.size()) IsPrime.resize(max + 1, true);
  IsPrime[0] = false;
  IsPrime[1] = false;
  for (size_t i = 2; i * i <= max; ++i)
    if (IsPrime[i])
      for (size_t j = 2; i * j <= max; ++j) IsPrime[i * j] = false;
}
const int mod = 1000000007;
const ll ex = -100000;
ll n, k, s;
std::vector<ll> ans;
int main() {
  cin >> n >> k >> s;
  ans.resize(n);
  for (ll i = 0; i < k - 1; i++) {
    ans[i] = s;
  }
  for (ll i = k; i < n; i++) {
    ans[i] = (s != 1000000000 ? s + 1 : 1);
  }
  for (ll i = 0; i < n; i++) {
    cout << ans[i] << " ";
  }
  cout << endl;
}
