#include <bits/stdc++.h>
const long long MOD = 1000000007;
int upcmpll(const void *a, const void *b) {
  return (*(long long *)a == *(long long *)b
              ? 0
              : (*(long long *)a > *(long long *)b ? 1 : -1));
}
void sort_u(long long *a, int n) { qsort(a, n, sizeof(long long), upcmpll); }
int main() {
  int n, k, s;
  scanf("%d%d%d", &n, &k, &s);
  int a[101010];
  int m = n / k, r = n % k;
  if (k <= n) {
    for (long long i = 0; i < (long long)(n); i++) {
      if (i < k)
        a[i] = s;
      else
        a[i] = (1000000000 + s) % 1000000000;
    }
  }
  for (long long i = 0; i < (long long)(n); i++) printf("%d ", a[i]);
}
