#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int M = 200111;
const int inf = 1000000007;
const long long INF = 1e18;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, -1, 0, 1};
int ddx[8] = {1, -1, 0, 0, 1, -1, -1, 1}, ddy[8] = {0, 0, 1, -1, 1, -1, 1, -1};
void sosu(ll x, bool f[]) {
  ll y = x;
  for (ll i = 2; i <= sqrt(y); i++) {
    if (x % i == 0) {
      x /= i;
      f[i] = true;
      i--;
    }
  }
}
ll __gcd(ll x, ll y) {
  if (x < y) swap(x, y);
  while (1) {
    ll tmp = x % y;
    x = y;
    y = tmp;
    if (y == 0) break;
  }
  return x;
}
int main() {
  int n, k, s;
  cin >> n >> k >> s;
  int cnt = 0;
  for (int i = 0; i < n; i++) {
    if (cnt >= k)
      cout << s + 1 << " ";
    else
      cout << s << " ";
    cnt++;
  }
}
