#include <bits/stdc++.h>
using namespace std;
const long long LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int mod = 1000000007;
const int MAX = 1000000000;
int main() {
  int n, k;
  long long s;
  cin >> n >> k >> s;
  vector<long long> ans(n, (s - 1));
  int id = 1;
  while (k > 0) {
    ans[id] = abs(ans[id - 1] - s);
    --k;
    if (k == 0) break;
    ++id;
  }
  if (id < n - 1) {
    ++id;
    for (int i = id; i < n; ++i) {
      if (s != MAX)
        ans[i] = MAX;
      else
        ans[i] = MAX - 2;
    }
  }
  for (int i = 0; i < (n); ++i) cout << ans[i] << " ";
  cout << endl;
  return 0;
}
