#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 MOD = 1e9 + 7;
const i64 INF = i64(1e18) + 7;
template <typename T>
bool chmin(T& x, T y) {
  if (x > y) {
    x = y;
    return true;
  }
  return false;
}
template <typename T>
bool chmax(T& x, T y) {
  if (x < y) {
    x = y;
    return true;
  }
  return false;
}
void solve(long long n, long long k, long long s) {
  for (int i = 0; i < k; ++i) cout << s << " \n"[i == n - 1];
  for (int i = k; i < n; ++i) cout << (s == 1 ? 2 : s - 1) << " \n"[i == n - 1];
}
signed main() {
  long long N;
  scanf("%lld", &N);
  long long K;
  scanf("%lld", &K);
  long long S;
  scanf("%lld", &S);
  solve(N, K, S);
  return 0;
}
