#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template <class T, class U>
using P = pair<T, U>;
template <class T>
using Heap = priority_queue<T>;
template <class T>
using heaP = priority_queue<T, vector<T>, greater<T>>;
template <class T, class U>
using umap = unordered_map<T, U>;
template <class T>
using uset = unordered_set<T>;
template <class T>
bool ChangeMax(T& a, const T& b) {
  if (a >= b) return false;
  a = b;
  return true;
}
template <class T>
bool ChangeMin(T& a, const T& b) {
  if (a <= b) return false;
  a = b;
  return true;
}
template <class T, size_t N, class U>
void Fill(T (&a)[N], const U& v) {
  fill((U*)a, (U*)(a + N), v);
}
template <class T>
istream& operator>>(istream& is, vector<T>& v) {
  for (auto& e : v) is >> e;
  return is;
}
int main() {
  int n, k, s;
  cin >> n >> k >> s;
  vector<int> v;
  int sum = 0;
  for (int i = 1; i <= n; ++i) {
    if (k <= i && sum < s && k > 0) {
      v.push_back(s - sum);
      sum += s - sum;
      k--;
    } else {
      if (sum + 1 == s) {
        v.push_back(2);
        sum += 2;
      } else {
        v.push_back(1);
        sum += 1;
      }
    }
    if (i >= k) sum -= v[i - k];
  }
  for (int i = 0; i < n; ++i) cout << v[i] << endl;
}
