#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9;
int a[1000000], b[1000000];
int main() {
  queue<long long int> sq;
  long long int d, i, n, k, s, an, ans = 0, cnt = 0, l, r;
  cin >> n >> k >> s;
  while (cnt < k) {
    sq.push(s);
    cnt++;
  }
  for (int i = 0; i < n - k; i++) {
    if (s = 1e9)
      s = 1;
    else
      s = s + 1;
    sq.push(s);
  }
  while (!sq.empty()) {
    cout << sq.front() << " ";
    sq.pop();
  }
  return 0;
}
