#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
const long long int mod = 1000000007ll;
const long long int smod = 998244353ll;
const long long int inf = 10000000000000007ll;
const double eps = 1e-10;
struct less_key {
  bool operator()(const pair<long long int, long long int>& p1,
                  const pair<long long int, long long int>& p2) const {
    return p1.first < p2.first;
  }
};
const long long int MAXN = 300005;
long long int n, k, s;
long long int a[MAXN];
int main(int argc, char* argv[]) {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout.precision(15);
  cout.setf(ios::fixed);
  cin >> n >> k >> s;
  a[k] = s;
  for (long long int i = k + 1; i <= n; i++) {
    a[i] = s == 1000000000 ? 1 : 1000000000;
  }
  for (long long int i = 1; i <= n; i++) {
    cout << a[i] << " ";
  }
  return 0;
}
