#include <bits/stdc++.h>
using namespace std;
class mod {
 public:
  long long val;
  mod(long long v) { val = v % 1000000007; }
  mod() { val = 0; }
  void operator-=(const mod &v) {
    val -= v.val;
    if (val < 0) val += 1000000007;
  }
  void operator+=(const mod &v) {
    if (val + v.val >= 1000000007) val -= 1000000007;
    val += v.val;
  }
  void operator+=(long long &v) {
    if (val + v >= 1000000007) val -= 1000000007;
    val += v;
  }
  void operator*=(const mod &v) {
    val *= v.val;
    val %= 1000000007;
  }
  void operator*=(long long &v) {
    val *= v;
    val %= 1000000007;
  }
  long long modinv(long long a) {
    long long b = 1000000007, u = 1, v = 0;
    while (b) {
      long long t = a / b;
      a -= t * b;
      swap(a, b);
      u -= t * v;
      swap(u, v);
    }
    u %= 1000000007;
    if (u < 0) u += 1000000007;
    return u;
  }
  void operator/=(const mod &v) {
    val *= modinv(v.val);
    val %= 1000000007;
  }
  void operator/=(long long &v) {
    val *= modinv(v);
    val %= 1000000007;
  }
};
vector<int> xm, ym;
int x, y;
int main() {
  int n, k;
  long long s;
  cin >> n >> k >> s;
  if (n > k) {
    const long long m = 1000000000;
    for (int i = 0; i < k + 1; i++)
      printf("%d ", s / 2 + (s % 2 == 1 && i % 2 == 1 ? 1 : 0));
    for (int i = k + 1; i < n; i++) printf("%d ", (s != m ? m : 1));
  } else {
    for (int i = 0; i < n; i++) printf("%d ", s);
  }
  return 0;
}
