#include <bits/stdc++.h>
using namespace std;
long long N, K, S;
const int MAX = 1.0e5 + 10;
const int INF = 1.0e9;
int main() {
  cin >> N >> K >> S;
  if (K == 0) {
    if (S == INF) {
      for (int i = 0; i < N; i++) {
        cout << 1 << " ";
      }
      cout << endl;
    } else {
      for (int i = 0; i < N; i++) {
        cout << S + 1 << " ";
      }
      cout << endl;
    }
  } else {
    long long win = N - K + 1;
    if (win <= S) {
      long long A[N];
      long long now = 0;
      A[0] = (S + win - 1) / win;
      for (int i = 1; i < win; i++) {
        A[i] = S / win;
        now += A[i];
      }
      for (int i = win; i < N; i++) {
        A[i] = S - now;
        now -= A[i - win + 1];
        now += A[i];
      }
      for (int i = 0; i < N; i++) {
        cout << A[i] << " ";
      }
      cout << endl;
    } else {
      for (int i = 0; i < N; i++) {
        if (i < K)
          cout << S << " ";
        else
          cout << INF << " ";
      }
      cout << endl;
    }
  }
  return 0;
}
