#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 (S == 1000000000) {
    if (K == 0) {
      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 {
      long long key = 0;
      long long tmp = 0;
      for (long long i = 0; i < N; i++) {
        key++;
        if (tmp == N - K) {
          break;
        }
        if (key == S) {
          key = 0;
          continue;
        }
        ans[i] = 3;
        tmp++;
      }
    }
  } else if (S == 2) {
    for (int i = 0; i < (int)(N - K); i++) ans[i] = S + 1;
  } else {
    for (int i = 0; i < (int)(N - K); i++) ans[i] = S - 1;
  }
  for (int i = 0; i < (int)(ans.size()); i++) {
    cout << ans[i];
    if (i + 1 != ans.size()) cout << " ";
  }
  cout << endl;
}
