#include <bits/stdc++.h>
using namespace std;
long long n, k, s, f[100010];
map<long long, long long> m;
void solve() {
  cin >> n >> k >> s;
  long long cur = s;
  while (k--) {
    m[cur] = 1;
    cur += s;
    n--;
  }
  cur = 1;
  while (n--) {
    while (m.find(cur) != m.end() || m.find(cur - s) != m.end() ||
           m.find(cur + s) != m.end())
      cur++;
    m[cur] = 1;
    cur++;
  }
  long long pre = 0;
  for (auto it : m) {
    cout << it.first - pre;
    pre = it.first;
    cout << " ";
  }
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solve();
  return 0;
}
