#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
int main() {
  int n, k, s;
  cin >> n >> k >> s;
  int a0 = s / (n - k + 1);
  int a1 = s % (n - k + 1);
  vector<int> v(n, a0);
  if (a0 == 0 || k > n / 2) {
    for (int j = 0; j < k; ++j) v[j] = s;
    for (int j = k; j < n; ++j) v[j] = s + 1;
  } else {
    v[n - k] += a1;
  }
  for (int i = 0; i < n; ++i) cout << v[i] << " ";
  return 0;
}
