#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const long long mod = 1e9 + 7;
const long long Mod = 998244353;
const ll inf = 3 * 1e18;
const long long Inf = 15 * 1e8;
const vector<long long> dx{0, 0, -1, 1}, dy{1, -1, 0, 0};
template <class T>
bool chmax(T& a, const T& b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T& a, const T& b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
ll read() {
  ll u, k = scanf("%lld", &u);
  return u;
}
string reads() {
  string s;
  cin >> s;
  return s;
}
ll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }
ll mod_pow(ll x, ll n, ll p) {
  ll res = 1;
  while (n > 0) {
    if (n & 1) res = res * x % p;
    x = x * x % p;
    n >>= 1;
  }
  return res;
}
ll bitcount(ll x) {
  long long sum = 0;
  for (long long i = 0; i < 60; i++)
    if ((1ll << i) & x) sum++;
  return sum;
}
long long n, k, s;
signed main() {
  cin >> n >> k >> s;
  for (long long(i) = 0; (i) < (k); (i)++)
    cout << s << (i == n - 1 ? "\n" : " ");
  long long r = 1;
  for (long long i = 2; i * i <= s; i++) {
    if (s % i) r = i;
  }
  for (long long(i) = 0; (i) < (n - k); (i)++) {
    cout << r << (i == n - k - 1 ? "\n" : " ");
  }
}
