#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;
  if (k == 0) {
    while (cnt < n) {
      if (s == 1e9) s = 1;
      sq.push(s);
      s++;
      cnt++;
    }
  } else {
    while (ans < k) {
      sq.push(s);
      cnt++;
      ans++;
    }
    if (s == 1e9) s++;
    while (cnt < n) {
      sq.push(s);
      s++;
      cnt++;
    }
  }
  while (!sq.empty()) {
    cout << sq.front() << " ";
    sq.pop();
  }
  return 0;
}
