#include <bits/stdc++.h>
using namespace std;
long long mod = (1000000007LL);
inline long long poww(long long a, long long b) {
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = (res * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return res;
}
inline pair<int, int> operator+(pair<int, int> A, pair<int, int> B) {
  return pair<int, int>(A.first + B.first, A.second + B.second);
}
inline pair<int, int> operator-(pair<int, int> A, pair<int, int> B) {
  return pair<int, int>(A.first - B.first, A.second - B.second);
}
inline long long mult(long long a, long long b) { return (a * b) % mod; }
long long gcd(long long a, long long b) {
  while (b) {
    a %= b;
    swap(a, b);
  }
  return a;
}
int n, m, q, k, v[300050];
pair<int, int> TT, w[300050];
int second;
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> k >> second;
  for (int i = 1; i <= n; i++) {
    if (i < k)
      cout << "0 ";
    else if (i == k)
      cout << second << " ";
    else if (second == (1000000000))
      cout << "1 ";
    else
      cout << second + 1 << " ";
  }
  cout << "\n";
}
