#include <bits/stdc++.h>
const double PI = 3.14159265358979323846;
using namespace std;
const double EPS = 1e-9;
bool contain(set<char> &s, char a) { return s.find(a) != s.end(); }
const int mod = 1000000007;
typedef priority_queue<long long, vector<long long>, greater<long long> >
    PQ_ASK;
int main() {
  long long n, k, s;
  cin >> n >> k >> s;
  if (k == 0) {
    vector<long long> ans(n, s + 1);
    for (long long a : ans) cout << a << ' ';
    return 0;
    ;
  }
  vector<long long> ans(n, s + 1);
  for (int i = 0; i < k; i++) {
    ans[i] = s;
  }
  for (long long a : ans) cout << a << ' ';
}
