#include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
const long long INF = (1ll << 60);
template <class T>
bool umax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
bool umin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
T gcd(T a, T b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
int findGCD(vector<int> arr) {
  int result = arr[0];
  for (auto a : arr) {
    result = gcd(a, result);
  }
  return result;
}
template <typename T>
T lcm(T m, T n) {
  if ((0 == m) || (0 == n)) return 0;
  return ((m / gcd(m, n)) * n);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
  fill((T *)array, (T *)(array + N), val);
}
long long euler_phi(long long n) {
  long long ret = n;
  for (long long i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      ret -= ret / i;
      while (n % i == 0) n /= i;
    }
  }
  if (n > 1) ret -= ret / n;
  return ret;
}
class Combination {
  long long powmod(long long a, long long p) {
    long long ans = 1LL;
    long long mul = a;
    while (p > 0) {
      if ((p & 1) == 1) {
        ans = (ans * mul) % MOD;
      }
      mul = (mul * mul) % MOD;
      p >>= 1;
    }
    return ans;
  }

 public:
  int N;
  long long mod;
  vector<long long> fact;
  vector<long long> revfact;
  Combination(int n, long long m) : N(n), mod(m), fact(n + 1), revfact(n + 1) {
    fact[0] = 1;
    for (int i = 1; i <= N; i++) {
      fact[i] = fact[i - 1] * i;
      fact[i] %= mod;
    }
    revfact[N] = powmod(fact[N], mod - 2);
    for (int i = N - 1; i >= 0; i--) {
      revfact[i] = revfact[i + 1] * (i + 1) % mod;
    }
  }
  long long getCombination(int a, int b) {
    if (a < 0 || b < 0) return 0;
    if (b > a) return 0;
    return fact[a] * revfact[b] % mod * revfact[a - b] % mod;
  }
};
int main() {
  int N;
  cin >> N;
  int K;
  cin >> K;
  long long s;
  cin >> s;
  vector<long long> A(N, s);
  for (int i = K; i < N; i++) {
    A[i] = s + 1;
  }
  for (int i = 0; i < (int)(N); i++) {
    cout << A[i] << ' ';
  }
  cout << endl;
  return 0;
}
