#include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
long long INF = 1000000000000000;
long long powMod(long long x, long long n) {
  if (n == 0) return 1;
  long long r = powMod(x, n / 2);
  if (n % 2 == 0) return (r * r) % MOD;
  return (r * r % MOD) * x % MOD;
}
int main(void) {
  int n, k;
  long long s;
  cin >> n >> k >> s;
  if (s == 2 || s == 1) {
    for (int i = 0; i < int(k); i++) cout << s << " ";
    for (int i = 0; i < int(n - k - 1); i++) cout << s + 1 << " ";
    cout << s + 1 << endl;
  } else {
    for (int i = 0; i < int(k); i++) cout << s << " ";
    for (int i = 0; i < int(n - k - 1); i++) cout << s - 1 << " ";
    cout << s - 1 << endl;
  }
  return 0;
}
