#include <bits/stdc++.h>
using namespace std;
const int N = 1000000;
const long long mod = 1000000007;
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
  long long n, k, s;
  cin >> n >> k >> s;
  if (n % 2 == 0) {
    for (long long int i = 0; i < n / 2; i++) {
      if (i == (n / 2) - 1)
        cout << i + 1 << " " << s - (i + 1);
      else
        cout << i + 1 << " " << s - (i + 1) << " ";
    }
    cout << endl;
  } else {
    for (long long int i = 0; i < n / 2; i++) {
      if (i == (n / 2) - 1)
        cout << i + 1 << " " << s - (i + 1);
      else
        cout << i + 1 << " " << s - (i + 1) << " ";
    }
    cout << " " << s << endl;
  }
}
