#include <bits/stdc++.h>
const int INF = 1000000007;
const long double EPS = 1e-15;
const long double PI = acos(-1);
using namespace std;
using Graph = vector<vector<int>>;
using Graph_weighted = vector<vector<pair<int, int>>>;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
long long ceil(const long long a, const long long b) { return (a + b - 1) / b; }
int main() {
  int n, k, s;
  cin >> n >> k >> s;
  if (s == 1e9) {
    for (int i = 0; i < (k); ++i) cout << 1e9 << endl;
    for (int i = 0; i < (n - k); ++i) cout << 1 << endl;
  } else {
    for (int i = 0; i < (k); ++i) cout << s << endl;
    for (int i = 0; i < (n - k); ++i) cout << 1e9 << endl;
  }
  return 0;
}
