#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
int main() {
  int n, k, s;
  cin >> n >> k >> s;
  int l = n - k + 1;
  vector<int> a;
  vector<int> b;
  for (int i = 0; i < (l - 1); i++) {
    b.push_back(max(1, s / l));
  }
  b.push_back(s - (s / l) * (l - 1));
  while (a.size() < n) {
    for (int i = 0; i < (l); i++) {
      a.push_back(b[i]);
      if (a.size() == n) break;
    }
  }
  for (int i = 0; i < (n); i++) cout << a[i] << ' ';
  cout << endl;
  return 0;
}
