#include <bits/stdc++.h>
using namespace std;
using P = pair<long long, long long>;
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
const long long MOD = 1000000007;
const int INF = 1 << 30;
int main() {
  long long N, K, S;
  cin >> N >> K >> S;
  vector<long long> d = {0};
  long long add = S;
  for (int i = 1; i <= K; ++i) {
    d.push_back(add * i);
  }
  add = S + 1;
  for (int i = 1; i <= N - K; ++i) {
    d.push_back(add * i);
  }
  sort(d.begin(), d.end());
  vector<long long> a(N);
  for (int i = 0; i < N; i++) a[i] = d[i + 1] - d[i];
  for (int i = 0; i < N; i++) cout << a[i] << " ";
  cout << endl;
}
