#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100000;
int mod(int n, int k) {
  if (n % k == 0) {
    return k;
  } else {
    return n % k;
  }
}
int main() {
  int n, k, s, a[MAXN];
  cin >> n >> k >> s;
  if (s <= MAXN) {
    for (int i = 1; i <= k; i++) {
      cout << s << " ";
    }
    for (int i = 1; i <= n - k; i++) {
      cout << s + 1 << " ";
    }
  } else {
    int j = s / MAXN;
    for (int i = 1; i <= j; i++) {
      a[i] = MAXN;
      cout << MAXN << " ";
    }
    a[j + 1] = s % MAXN;
    cout << a[j + 1] << " ";
    for (int i = 1; i < k; i++) {
      cout << a[mod(i, j + 1)] << " ";
    }
    for (int i = 1; i <= n - k - j; i++) {
      cout << 10 << " ";
    }
  }
}
