#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1000000007;
struct mint {
  ll x;
  mint(ll x = 0) : x((x % mod + mod) % mod) {}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod - a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a) const {
    mint res(*this);
    return res += a;
  }
  mint operator-(const mint a) const {
    mint res(*this);
    return res -= a;
  }
  mint operator*(const mint a) const {
    mint res(*this);
    return res *= a;
  }
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1) a *= *this;
    return a;
  }
  mint inv() const { return pow(mod - 2); }
  mint& operator/=(const mint a) { return (*this) *= a.inv(); }
  mint operator/(const mint a) const {
    mint res(*this);
    return res /= a;
  }
};
struct combination {
  vector<mint> fact, ifact;
  combination(int n) : fact(n + 1), ifact(n + 1) {
    assert(n < mod);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i - 1] * i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i - 1] = ifact[i] * i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 0;
    return fact[n] * ifact[k] * ifact[n - k];
  }
};
int main() {
  int n, k;
  ll s;
  cin >> n >> k >> s;
  if (s != 1) {
    if (n > k && s % 2 == 0) {
      for (int(i) = 0; (i) < (k); (i)++) {
        cout << s / 2 << " ";
      }
      cout << s / 2 << " ";
      for (int(i) = (k + 1); (i) < (n); (i)++) {
        cout << s + 1 << " ";
      }
    }
    if (n == k) {
      for (int(i) = 0; (i) < (k); (i)++) {
        cout << s << " ";
      }
    }
    if (n > k && s % 2 == 1) {
      int cnt = 0;
      for (int(i) = 0; (i) < (k); (i)++) {
        if (cnt % 2 == 0)
          cout << s / 2 << " ";
        else
          cout << s / 2 + 1 << " ";
        cnt++;
      }
      if (cnt % 2 == 0)
        cout << s / 2 << " ";
      else
        cout << s / 2 + 1 << " ";
      for (int(i) = (k + 1); (i) < (n); (i)++) {
        cout << s + 1 << " ";
      }
    }
  } else {
    for (int(i) = 0; (i) < (k); (i)++) {
      cout << s << " ";
    }
    for (int(i) = (k); (i) < (n); (i)++) {
      cout << s + 1 << " ";
    }
  }
}
