#include <bits/stdc++.h>
using namespace std;
using pii = pair<long long, long long>;
constexpr long long INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr long long mod = 1e9 + 7;
constexpr long long MOD = 998244353;
template <class A, class B>
inline bool chmax(A &a, const B &b) {
  return b > a && (a = b, true);
}
template <class A, class B>
inline bool chmin(A &a, const B &b) {
  return b < a && (a = b, true);
}
template <class T>
using min_heap = priority_queue<T, vector<T>, greater<T> >;
template <class T>
using max_heap = priority_queue<T>;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  long long n, k, s;
  cin >> n >> k >> s;
  if (s != 1e9) {
    if (k == 0) {
      for (long long i = 0; i < (n); ++i) {
        cout << (i == 0 ? "" : " ") << (long long)(1e9);
      }
      cout << '\n';
      return 0;
    }
    for (long long i = 0; i < (k); ++i) {
      cout << (i == 0 ? "" : " ") << s;
    }
    for (long long i = 0; i < (n - k); ++i) {
      cout << " " << (long long)(1e9);
    }
    cout << '\n';
  } else {
    if (k == 0) {
      for (long long i = 0; i < (n); ++i) {
        cout << (i == 0 ? "" : " ") << 0;
      }
      cout << '\n';
      return 0;
    }
    for (long long i = 0; i < (k); ++i) {
      cout << (i == 0 ? "" : " ") << s;
    }
    for (long long i = 0; i < (n - k); ++i) {
      cout << " " << 1;
    }
    cout << '\n';
  }
  return 0;
}
