#include <bits/stdc++.h>
using namespace std;
priority_queue<long long, vector<long long>, greater<long long>> que;
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
long long n, k, s;
void solve() {
  cin >> n >> k >> s;
  vector<long long> v;
  for (int i = 0; i < k; i++) {
    v.push_back(s);
  }
  for (int i = k; i < n; i++) {
    v.push_back(s + 1);
  }
  for (int i = 0; i < n; i++) cout << v[i] << " ";
  cout << endl;
}
int main(int argc, char* argv[]) {
  solve();
  return 0;
}
