#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, sum;
  cin >> n >> k >> sum;
  long long val1 = sum / 2;
  long long val2 = sum - val1;
  long long a[n];
  fill(a, a + n, sum + 1);
  if (sum % 2 == 0) {
    for (long long(i) = 0; i < (k + 1); i++) a[i] = val1;
  } else {
    a[0] = val1;
    for (long long(i) = (1); (i) < (k + 1); (i)++) {
      if (a[i - 1] == val1)
        a[i] = val2;
      else
        a[i] = val1;
    }
  }
  for (long long(i) = 0; i < (n); i++) {
    if (i) cout << " ";
    cout << a[i];
  }
  return 0;
}
