#include <bits/stdc++.h>
using namespace std;
const int INF = 1001001000;
const int mINF = -1001001000;
const long long LINF = 10100100100100100;
int main() {
  int n, k, s;
  cin >> n >> k >> s;
  int h1 = s / 2;
  int h2 = s - h1;
  int hh = max(h1, h2) + 1;
  vector<int> ans(n);
  for (int i = 0; i < k + 1; i++) {
    if (i % 2 == 0)
      ans[i] = h1;
    else
      ans[i] = h2;
  }
  for (int i = k + 1; i < n; i++) ans[i] = hh;
  for (int i = 0; i < n; i++) cout << ans[i] << " ";
  cout << endl;
  return 0;
}
