#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
ll gcd(ll a, ll b) {
  if (a % b == 0) {
    return b;
  }
  return gcd(b, a % b);
}
ll fact(ll n) {
  if (n == 0) {
    return 1;
  }
  if (n == 1) {
    return 1;
  }
  return n * fact(n - 1) % MOD;
}
int main() {
  ll N, K, S;
  cin >> N >> K >> S;
  ll s = S;
  ll mode = 0;
  ll cnt = 0;
  vector<ll> ans;
  for (ll i = 0; i < N; i++) {
    if (cnt == K) {
      break;
    }
    if (s > 1e5) {
      ans.push_back(1e5);
      s -= 1e5;
      if (mode == 1) {
        cnt += 1;
      }
    } else {
      ans.push_back(s);
      s = S;
      cnt += 1;
      mode = 1;
    }
  }
  for (ll i = 0; i < ans.size(); i++) {
    cout << ans[i];
    if (i == ans.size() - 1) {
      cout << endl;
    } else {
      cout << " ";
    }
  }
}
