#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) {
  while (b != 0) {
    a %= b;
    swap(a, b);
  }
  return a;
}
ll kaizyou(ll N) {
  ll num = 1;
  for (ll i = 1; i <= N; i++) {
    num *= i;
  }
  return num;
}
int dy[] = {-1, 0, 1, 0};
int dx[] = {0, -1, 0, 1};
int main() {
  int N, K, S;
  cin >> N >> K >> S;
  if (S != 1e9) {
    for (int i = 0; i < K; i++) {
      cout << S << endl;
    }
    for (int i = K; i < N; i++) {
      cout << 1000000009 << endl;
    }
  }
  if (S == 1e9) {
    for (int i = 0; i < K; i++) {
      cout << S << endl;
    }
    for (int i = K; i < N; i++) {
      cout << 17 << endl;
    }
  }
}
