#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
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; };
long long mod(long long a, long long b) { return (a + b - 1) / b; };
long long month[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T& val) {
  std::fill((T*)array, (T*)(array + N), val);
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
};
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
};
signed main() {
  cin.tie(0);
  cout.tie(0);
  ios::sync_with_stdio(false);
  long long n, k, sum;
  cin >> n >> k >> sum;
  vector<long long> a(n);
  if (sum == 1)
    fill((a).begin(), (a).end(), 5);
  else
    fill((a).begin(), (a).end(), 1);
  for (long long(i) = 0; i < (k); i++) a[i] = sum;
  for (long long(i) = 0; i < (n); i++) cout << a[i] << " ";
  cout << endl;
  return 0;
}
