#include <bits/stdc++.h>
using namespace std;
int a[1000000], b[1000000];
int main() {
  queue<int> sq;
  long long int i, n, k, s, an, ans = 0, cnt = 0, l, r;
  cin >> n >> k >> s;
  if (k == 0) {
    while (cnt < n) {
      s++;
      sq.push(s);
      cnt++;
    }
  } else if (s % 2 != 0) {
    cnt = 0;
    l = s / 2;
    r = s / 2 + 1;
    while (l > 0 && cnt <= n) {
      sq.push(l);
      sq.push(r);
      l--;
      r++;
      ans++;
      cnt += 2;
    }
    while (ans < k && cnt <= n) {
      sq.push(s);
      cnt++;
      ans++;
    }
    int d = s;
    if (cnt < n) {
      d++;
      sq.push(d);
      cnt++;
    }
  } else if (s % 2 == 0) {
    an = s / 2;
    sq.push(an);
    cnt++;
    while (ans < k - 1) {
      sq.push(an);
      cnt++;
      ans++;
    }
    sq.push(an);
    cnt++;
    l = s / 2 - 1;
    r = s / 2 + 1;
    while (cnt < n - 1 && ans < k) {
      sq.push(l);
      sq.push(r);
      cnt += 2;
      ans++;
    }
    r++;
    while (cnt < n) {
      sq.push(r);
      r++;
      if (r == s) r++;
      cnt++;
    }
  }
  while (!sq.empty()) {
    cout << sq.front() << " ";
    sq.pop();
  }
  return 0;
}
