#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vli = vector<lint>;
using vc = vector<char>;
using vs = vector<string>;
using vb = vector<bool>;
using vvi = vector<vi>;
using vvb = vector<vb>;
using vvc = vector<vc>;
using vpii = vector<pii>;
using msi = map<string, int>;
template <class T>
lint gcd(T a, T b) {
  int t;
  while (b != 0) {
    t = a % b;
    a = b;
    b = t;
  }
  return a;
}
template <class T>
lint lcm(T a, T b) {
  return a * b / gcd(a, b);
}
double distance(pii a, pii b) {
  double dist;
  dist = sqrt((a.first - b.first) * (a.first - b.first) +
              (a.second - b.second) * (a.second - b.second));
  return dist;
}
lint perm(int a) {
  lint perm = 1;
  for (int i = a; i >= 1; i--) {
    perm *= i;
  }
  return perm;
}
lint combination(int n, int m) {
  long double c = 1;
  for (int i = n, k = 1; i > m; i--, k++) {
    c *= i;
    c /= k;
  }
  return (lint)c;
}
template <class T, class Q>
inline bool chmin(T& a, Q b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T, class Q>
inline bool chmax(T& a, Q b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int N, K, S;
  cin >> N >> K >> S;
  if (S == 1e9) {
    for (int i = 0; i < K; i++) cout << S << " ";
    for (int i = 0; i < N - K - 1; i++) cout << 3 << " ";
  } else {
    for (int i = 0; i < K; i++) cout << S << " ";
    for (int i = 0; i < N - K - 1; i++) cout << S + 1 << " ";
  }
}
