#include <bits/stdc++.h>
using namespace std;
long N, K, S;
long A[100000];
int ans = 0;
void solve() {
  long cand[2] = {S / 2, S / 2 + S % 2};
  long diff = N - K;
  long counter = K;
  if (N - K == 0) {
    for (int i = 0; i < N; i++) A[i] = S;
    return;
  } else if (N - K == 1) {
    for (int i = 0; i < N; i++) A[i] = cand[i % 2];
    return;
  } else if (N - K == 2) {
    for (int i = 0; i < N - 2; i++) A[i] = cand[i % 2];
    if (S <= 5) {
      A[N - 2] = S + 1;
      A[N - 1] = S;
    } else {
      A[N - 2] = cand[(N - 2) % 2] - 2;
      A[N - 1] = cand[(N - 2) % 2] + 2;
    }
    return;
  } else {
    for (int i = 0; i < K - 1; i++) {
      A[i] = cand[i % 2];
    }
    if (S <= 999999999l) {
      for (int i = K - 1; i < N - 1; i++) {
        A[i] = 1000000000l;
      }
      A[N - 1] = S;
    } else {
      for (int i = K - 1; i < N - 1; i++) {
        A[i] = 98789878l;
      }
      A[N - 1] = S;
    }
  }
}
int main() {
  cin >> N >> K >> S;
  solve();
  for (int i = 0; i < N; i++) cout << A[i] << ' ';
  return 0;
}
