#include <bits/stdc++.h>
using namespace std;
int main() {
  long long N, K, S;
  cin >> N >> K >> S;
  if (N - K + 1 <= S) {
    vector<long long> V(N - K + 1);
    for (int i = 0; i < N - K; i++) V[i] = 1;
    V[N - K] = S + K - N;
    for (int i = 0; i < N; i++) {
      cout << V[i % (N - K + 1)];
      if (i == N - 1)
        cout << endl;
      else
        cout << " ";
    }
    return 0;
  } else {
    vector<long long> ANS;
    for (int i = 0; i < K; i++) ANS.push_back(K);
    for (int i = K; i < N; i++) ANS.push_back(K + 1);
    for (int i = 0; i < N; i++) {
      cout << ANS[i];
      if (i == N - 1)
        cout << endl;
      else
        cout << " ";
    }
    return 0;
  }
}
