#include <bits/stdc++.h>
using namespace std;
template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
constexpr long long mod = 1e9 + 7;
constexpr long long INF = mod * mod;
constexpr int MAX = 1000010;
int main() {
  int n, K, S;
  scanf("%d%d%d", &n, &K, &S);
  vector<int> ans;
  if (S == 1) {
    for (int((i)) = (0); ((i)) < ((K)); ++((i))) ans.push_back(1);
    for (int((i)) = (0); ((i)) < ((n - K)); ++((i))) ans.push_back(mod - 7);
  } else {
    ans.push_back(1);
    for (int((i)) = (0); ((i)) < ((K)); ++((i)))
      ans.push_back(i % 2 == 0 ? S - 1 : 1);
    if (S != mod - 7)
      for (int((i)) = (0); ((i)) < ((n - K - 1)); ++((i)))
        ans.push_back(mod - 7);
    else {
      int dummy = (int)(ans[ans.size() - 1] == 1 ? mod - 9 : mod - 8);
      for (int((i)) = (0); ((i)) < ((n - K - 1)); ++((i))) ans.push_back(dummy);
    }
  }
  assert(ans.size() == n);
  for (int x : ans) printf("%d ", x);
}
