#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
void mainsolve() {
  long long n, k, s;
  cin >> n >> k >> s;
  if (s - (n - k) < 1) {
    for (long long i = 0; i < (k); ++i) {
      cout << s << " ";
    }
    for (long long i = 0; i < (n - k); ++i) {
      cout << s + 1 << " ";
    }
  } else {
    for (long long i = 0; i < (k - 1); ++i) {
      cout << s << " ";
    }
    cout << s - (n - k) << " ";
    for (long long i = 0; i < (n - k); ++i) {
      cout << 1 << " ";
    }
  }
  cout << endl;
  return;
}
int main() {
  mainsolve();
  return 0;
}
