#include <bits/stdc++.h>
using namespace std;
long long mod(long long a, long long b) {
  if (a % b < 0) {
    return a % b + b;
  }
  return a % b;
}
long long mod_exp(long long a, long long b, long long c) {
  long long res = 1;
  a = a % c;
  while (b > 0) {
    if (b % 2 == 1) {
      res = (res * a) % c;
    }
    b /= 2;
    a = (a * a) % c;
  }
  return res;
}
long long mymod(long long a, long long b) { return ((a % b) + b) % b; }
bool prime[200000];
vector<long long> v;
void SieveOfEratosthenes() {
  memset(prime, true, sizeof(prime));
  prime[1] = false;
  for (int p = 2; p * p <= 200000; p++) {
    if (prime[p] == true) {
      v.push_back(p);
      for (int i = p * p; i <= 200000; i += p) prime[i] = false;
    }
  }
}
long long powe[60];
void power() {
  powe[0] = 1;
  for (long long i = 1; i < 15; i++) {
    powe[i] = 2 * powe[i - 1];
  }
}
long long gcdExtended(long long, long long, long long *, long long *);
long long modInverse(long long a, long long m) {
  long long x, y;
  long long g = gcdExtended(a, m, &x, &y);
  long long res = (x % m + m) % m;
  return res;
}
long long gcdExtended(long long a, long long b, long long *x, long long *y) {
  if (a == 0) {
    *x = 0, *y = 1;
    return b;
  }
  long long x1, y1;
  long long gcd = gcdExtended(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
long long fact[100005];
void factorial() {
  fact[0] = 1;
  for (long long i = 1; i < 100002; i++) {
    fact[i] = mymod(i * fact[i - 1], 1000000007);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n, k, s;
  long long count = 0;
  cin >> n >> k >> s;
  long long diff = n - k;
  for (long long i = 0; i < diff; i++) {
    cout << s + 1 << " ";
  }
  for (long long i = diff; i < n; i++) {
    cout << s << " ";
  }
  return 0;
}
