#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
const long long MOD = (int)1e9 + 7;
const long long INF = MOD * MOD;
long long n, m, k, ans;
string s, t;
const long long powll = 1LL << 1;
bool cmp(pair<int, int> a, pair<int, int> b) {
  return a.first + a.second < b.first + b.second;
}
int main(void) {
  int n, k, s;
  cin >> n >> k >> s;
  for (int i = 0; i < k; i++) {
    cout << s;
    if (i != n - 1) cout << " ";
  }
  for (int i = 0; i < n - k; i++) {
    cout << s - 1;
    if (i + k != n - 1) cout << " ";
  }
  cout << "\n";
}
