#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, s;
  cin >> n >> k >> s;
  int t = s / (n - k + 1) + (s % (n - k + 1) != 0);
  int a = 0;
  vector<int> retu(n - k + 1);
  for (int i = 0; i < n - k + 1; i++) {
    if (s >= t + a) {
      a += t;
      retu[i] = t;
    } else {
      retu[i] = s - a;
      a = s;
      break;
    }
  }
  for (int i = 0; i < n; i++) {
    cout << retu[i % (n - k + 1)] << ' ';
  }
  cout << endl;
}
