#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
long long fact(long long k) {
  long long sum = 1;
  for (long long i = 2; i <= k; i++) sum *= i;
  return sum;
}
long long fact_mod(long long k) {
  long long sum = 1;
  for (long long i = 2; i <= k; i++) sum = (sum * i) % MOD;
  return sum;
}
int ctoi(char c) {
  if (c >= '0' && c <= '9')
    return c - '0';
  else
    return -1;
}
long long pow_mod(int a, int b) {
  long long ans = 1;
  for (int i = 0; i < b; i++) ans = (ans * a) % MOD;
  return ans;
}
long long powll(long long a, long long b) {
  long long ans = 1;
  for (long long i = 0; i < b; i++) ans = ans * a;
  return ans;
}
long long modinv(long long a) {
  long long b = MOD, u = 1, v = 0;
  while (b) {
    long long t = a / b;
    a -= t * b;
    swap(a, b);
    u -= t * v;
    swap(u, v);
  }
  u %= MOD;
  if (u < 0) u += MOD;
  return u;
}
int main() {
  long long n, k, s;
  cin >> n >> k >> s;
  for (int i = 0; i < k; i++) cout << s << " ";
  for (int i = k; i < n; i++) cout << s + 1 << " ";
  cout << endl;
  return 0;
}
