#include <bits/stdc++.h>
using namespace std;
bool func(long long a) {
  long long s = 0;
  while (a != 0) {
    s += a % 10;
    a /= 10;
  }
  if (s == 10) return true;
  return false;
}
void merge(long long arr[], long long brr[], long long l, long long m,
           long long r) {
  long long i, j, k;
  long long n1 = m - l + 1;
  long long n2 = r - m;
  long long L[n1], R[n2];
  long long L1[n1], R1[n2];
  for (i = 0; i < n1; i++) {
    L[i] = arr[l + i];
    L1[i] = brr[l + i];
  }
  for (j = 0; j < n2; j++) {
    R[j] = arr[m + 1 + j];
    R1[j] = brr[m + 1 + j];
  }
  i = 0;
  j = 0;
  k = l;
  while (i < n1 && j < n2) {
    if (L[i] <= R[j]) {
      arr[k] = L[i];
      brr[k] = L1[i];
      i++;
    } else {
      arr[k] = R[j];
      brr[k] = R1[j];
      j++;
    }
    k++;
  }
  while (i < n1) {
    arr[k] = L[i];
    brr[k] = L1[i];
    i++;
    k++;
  }
  while (j < n2) {
    arr[k] = R[j];
    brr[k] = R1[j];
    j++;
    k++;
  }
}
void mergeSort(long long arr[], long long brr[], long long l, long long r) {
  if (l < r) {
    long long m = l + (r - l) / 2;
    mergeSort(arr, brr, l, m);
    mergeSort(arr, brr, m + 1, r);
    merge(arr, brr, l, m, r);
  }
}
int32_t main() {
  long long n, k, s;
  cin >> n >> k >> s;
  for (long long i = 0; i < n; ++i) {
    if (i < k)
      cout << s << " ";
    else
      cout << s + 1 << " ";
  }
  return 0;
}
