#include <bits/stdc++.h>
using namespace std;
vector<pair<string, pair<int, int> > > vec;
void solve(long long N, long long K, long long S) {
  long long maxS = 1000000000;
  vector<long long> A(N);
  if (S != maxS) {
    for (long long i = 0; i < K; i++) {
      A[i] = S;
    }
    for (long long i = K; i < N; i++) {
      A[i] = maxS;
    }
  } else {
    A[0] = maxS;
    for (long long i = 1; i < K; i++) {
      A[i] = 0;
    }
    for (long long i = K; i < N; i++) {
      A[i] = maxS;
    }
  }
  for (long long i = 0; i < N; i++) {
    cout << A[i];
    if (i != N - 1)
      cout << " ";
    else
      cout << endl;
  }
}
int main() {
  long long N;
  long long S;
  long long K;
  scanf("%lld", &N);
  scanf("%lld", &K);
  scanf("%lld", &S);
  solve(N, K, S);
  return 0;
}
