#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(i64 (i) = (s);(i) < (e);(i)++)
#define rev(i,s,e) for(i64 (i) = (s);(i) --> (e);)
#define all(x) x.begin(),x.end()

template<class T>
static inline std::vector<T> ndvec(size_t&& n, T val) noexcept {
  return std::vector<T>(n, std::forward<T>(val));
}

template<class... Tail>
static inline auto ndvec(size_t&& n, Tail&&... tail) noexcept {
  return std::vector<decltype(ndvec(std::forward<Tail>(tail)...))>(n, ndvec(std::forward<Tail>(tail)...));
}

int main() {
  i64 N, K, S;
  cin >> N >> K >> S;
  vector<i64> ans(N);
  ans[N - 1] = S;
  i64 P = 0;
  for(i64 i = 2;true;i++) {
    if(S % i != 0) {
      P = i;
      break;
    }
  }
  for(i64 i = 0;i < N - 1; i++) {
    if(i < K - 1)
      ans[N - 2 - i] = 0;
    else {
      ans[N - 2 - i] = P;
    }
  }
  rep(i,0,N) {
    cout << ans[i] << " \n"[i + 1 == N];
  }
}
