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