#include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  int n, k, s;
  cin >> n >> k >> s;
  vector<int> hoge(n);
  for (int i = 0; i < k; i++) {
    hoge[i] = s;
  }
  for (int i = k; i < n; i++) {
    if (s == 1000000000) {
      hoge[i] = 1000000000 - 1;
    } else {
      hoge[i] = s + 1;
    }
  }
  for (int i = 0; i < n; i++) {
    cout << hoge[i] << " ";
    if (i == n - 1) {
      cout << hoge[i] << endl;
    }
  }
}
