#include <bits/stdc++.h>
using namespace std;
template <class T>
void ShowVec(const std::vector<T>& v) {
  std::size_t e = v.size();
  for (std::size_t i = 0, e = v.size(); i < e - 1; ++i) {
    std::cout << v[i] << " ";
  }
  std::cout << v[e - 1] << std::endl;
}
int main() {
  int n, k, s;
  cin >> n >> k >> s;
  vector<int> res{s};
  vector<int> l;
  vector<int> r;
  int i = 1;
  int cnt = 1;
  bool is_right = true;
  while (true) {
    if (cnt == k) break;
    if (k - cnt == 1) {
      r.push_back(i);
      ++cnt;
    } else {
      if (k - cnt > 4) {
        r.push_back(i);
        r.push_back(s + i);
        l.push_back(s - i);
        l.push_back(i);
        cnt = cnt + 4;
      } else {
        if (is_right) {
          r.push_back(i);
          r.push_back(s + i);
          is_right = false;
        } else {
          l.push_back(s - i);
          l.push_back(i);
          is_right = true;
        }
      }
      cnt = cnt + 2;
    }
    ++i;
  }
  l.insert(l.end(), res.begin(), res.end());
  l.insert(l.end(), r.begin(), r.end());
  while (cnt < n) {
    l.push_back(1);
    ++cnt;
  }
  ShowVec(l);
  return 0;
}
