#include <bits/stdc++.h>
using namespace std;
long long i, j, k, l, n, m;
long long dp[200009];
pair<long long, long long> a[200009];
inline bool cmp(pair<long long, long long> a, pair<long long, long long> b) {
  if (a.second != b.second) return a.second < b.second;
  return a.first < b.first;
}
long long f[200009];
void add(long long x, long long d) {
  for (int i = x; i < 200009; i += i & -i) f[i] = max(f[i], d);
}
long long get(long long x) {
  long long res = 0;
  for (int i = x; i > 0; i -= i & -i) res = max(res, f[i]);
  return res;
}
vector<long long> nums;
long long pos(long long x) {
  return lower_bound(nums.begin(), nums.end(), x) - nums.begin();
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n >> k >> l;
  for (i = 1; i <= k; i++) cout << l << ' ';
  for (i = 1; i <= n - k; i++) cout << l + 1 << ' ';
  cout << '\n';
  exit(0);
}
