#include <bits/stdc++.h>
using namespace std;
const int INF = 100000000;
long long gcd(long long a, long long b) {
  long long tmp;
  if (a < b) {
    tmp = a;
    a = b;
    b = tmp;
  }
  if (b < 1) return -1;
  if (a % b == 0) return b;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
long long sosuu(long long x) {
  for (int i = 2; i < x; i++) {
    if (x % i == 0) return false;
  }
  return true;
}
int n, k, s;
int main() {
  cin >> n >> k >> s;
  int ans[n + 1];
  for (int i = 1; i <= n; i++) {
    if (i <= k) {
      ans[i] = s;
    } else {
      ans[i] = s - 1;
    }
  }
  for (int i = 1; i < n; i++) {
    cout << ans[i] << " ";
  }
  cout << ans[n] << endl;
  return 0;
}
