#include <bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
constexpr int INF = INT_MAX / 2;
constexpr long long LINF = LLONG_MAX / 2;
constexpr double eps = DBL_EPSILON;
constexpr double PI = 3.141592653589793238462643383279;
long long esp_new;
template <class T>
class prique : public std::priority_queue<T, std::vector<T>, std::greater<T>> {
};
template <class T, class U>
inline bool chmax(T& lhs, const U& rhs) {
  if (lhs < rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
template <class T, class U>
inline bool chmin(T& lhs, const U& rhs) {
  if (lhs > rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
inline long long gcd(long long a, long long b) {
  while (b) {
    long long c = a;
    a = b;
    b = c % b;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
bool isprime(long long n) {
  if (n == 1) return false;
  for (int i = 2; i * i <= n; i++) {
    if (n % i == 0) return false;
  }
  return true;
}
template <typename T>
T mypow(T a, unsigned int b) {
  T res(1), now(a);
  while (b) {
    if (b & 1) res *= now;
    b >>= 1;
    now *= now;
  }
  return res;
}
template <typename T>
void printArray(std::vector<T>& vec) {
  for (int i = 0; i < (long long)((int)vec.size() - 1); i++)
    std::cout << vec[i] << " ";
  if (!vec.empty()) std::cout << vec.back() << std::endl;
}
template <typename T>
void printArray(T l, T r) {
  T rprev = r;
  rprev--;
  for (T i = l; i != rprev; i++) {
    std::cout << *i << " ";
  }
  std::cout << *rprev << std::endl;
}
int n, k, s;
int main() {
  std::cin >> n >> k >> s;
  if (s == 1e9) {
    for (int i = 0; i < k; i++) std::cout << s << " ";
    for (int i = 0; i < n - k - 1; i++) std::cout << s - 1 << " ";
    std::cout << s - 1 << std::endl;
    return 0;
  }
  for (int i = 0; i < k; i++) std::cout << s << " ";
  for (int i = 0; i < n - k - 1; i++) std::cout << s + 1 << " ";
  std::cout << s + 1 << std::endl;
  return 0;
}
