#include <bits/stdc++.h>
using namespace std;
int main() {
  long long N, K, S;
  cin >> N >> K >> S;
  vector<long long> ans(N, S);
  if (K == 0 && S != 1000000000) {
    vector<long long> ans2(N, S + 1);
    for (int i = 0; i < (int)(ans2.size()); i++) {
      cout << ans2[i];
      if (i + 1 != ans2.size()) cout << " ";
    }
    cout << endl;
    return 0;
  } else if (K == 0) {
    vector<long long> ans2(N, 3);
    for (int i = 0; i < (int)(ans2.size()); i++) {
      cout << ans2[i];
      if (i + 1 != ans2.size()) cout << " ";
    }
    cout << endl;
    return 0;
  }
  long long tmp = 0;
  bool flag = false;
  for (int i = 0; i < (int)(S - 1); i++) {
    if (tmp == (N - K)) {
      flag = true;
      break;
    }
    ans[i] = 1;
    tmp++;
  }
  if (!flag) {
    for (int i = 0; i < (int)(S - 1); i++) {
      if (tmp == N - K) {
        flag = true;
        break;
      }
      ans[N - 1 - i] = 1;
      tmp++;
    }
  }
  if (!flag) {
    long long key = 0;
    for (long long i = S; i < N - S; i++) {
      if (tmp == N - K) {
        flag = true;
        break;
      }
      if (key == S) {
        key = 0;
        continue;
      }
      ans[i] = 1;
      tmp++;
      key++;
    }
  }
  for (int i = 0; i < (int)(N); i++) {
  }
  for (int i = 0; i < (int)(ans.size()); i++) {
    cout << ans[i];
    if (i + 1 != ans.size()) cout << " ";
  }
  cout << endl;
}
