#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
const int inf = 0x3f3f3f3f;
int n, k, s;
long long sum[maxn], ans[maxn];
int main() {
  scanf("%d%d%d", &n, &k, &s);
  for (int i = 1; i <= n; i++) {
    if (i <= k)
      ans[i] = s;
    else {
      if (s % 2 == 0)
        ans[i] = 3;
      else
        ans[i] = 2;
    }
  }
  for (int i = 1; i <= n; i++) {
    printf("%lld%s", ans[i], i == n ? "\n" : " ");
  }
  return 0;
}
