#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; };
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; };
long long mod(long long a, long long b) { return (a + b - 1) / b; };
long long month[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T& val) {
  std::fill((T*)array, (T*)(array + N), val);
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
};
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
};
signed main() {
  cin.tie(0);
  cout.tie(0);
  ios::sync_with_stdio(false);
  long long n, k, s;
  cin >> n >> k >> s;
  long long a[100010];
  if (n < k) {
    if (s % 2 == 0) {
      long long div = s / 2;
      a[0] = div;
      for (long long(i) = (1); (i) < (n); (i)++) {
        long long cur = (i * (i - 1)) / 2;
        if (cur >= k) break;
        a[i] = div;
      }
    } else {
      long long d1 = s - (s / 2);
      long long d2 = s / 2;
      a[0] = d1;
      a[1] = d2;
      for (long long(i) = (2); (i) < (n); (i)++) {
        long long cur = (i / 2 + 1) + mod(i, 2);
        if (cur >= k) break;
        if (a[i - 1] == d1)
          a[i] = d2;
        else
          a[i] = d1;
      }
    }
    for (long long(i) = 0; i < (n); i++) {
      if (i) cout << " ";
      cout << a[i];
    }
    return 0;
  }
  Fill(a, s * 2);
  for (long long(i) = 0; i < (k); i++) a[i] = s;
  for (long long(i) = 0; i < (n); i++) {
    if (i) cout << " ";
    cout << a[i];
  }
  return 0;
}
