#include <bits/stdc++.h>
using namespace std;
const int maxx = 1e5 + 7;
const int Inf = 1 << 30;
const long long INF = 1ll << 60;
int n, k, s;
int res[maxx];
int ans[maxx];
int main() {
  scanf("%d %d %d", &n, &k, &s);
  if (s == 1) {
    for (int i = 1; i <= k; i++) res[i] = 1;
    for (int i = k + 1; i <= n; i++) res[i] = 1e9;
    for (int i = 1; i <= n; i++) {
      if (i < n)
        printf("%d ", res[i]);
      else
        printf("%d\n", res[i]);
    }
  } else {
    for (int i = 1; i <= n; i++) ans[i] = 1e9;
    if (k) ans[1] = 1;
    int cnt = 0;
    for (int i = 2; i <= n; i++) {
      if (cnt == k) break;
      ans[i] = s - ans[i - 1];
      cnt++;
    }
    for (int i = 1; i <= n; i++) {
      if (i < n)
        printf("%d ", ans[i]);
      else
        printf("%d\n", ans[i]);
    }
  }
  return 0;
}
