#include <bits/stdc++.h>
using namespace std;
int main(){
  int N;
  long long M, K;
  cin >> N >> M >> K;
  deque<int> dq;
  dq.push_back(0);
  for (int i = 1; i < N; i++){
    if (K >= i){
      dq.push_front(i);
      K -= i;
    } else if (K == 0){
      dq.push_back(i);
    } else {
      dq.insert(dq.end() - K, i);
      K = 0;
    }
  }
  for (int i = 0; i < N; i++){
    if (dq[i] < N - 1){
      cout << dq[i] << endl;
    } else {
      cout << M - (long long) (N - 1) * (N - 2) / 2 << endl;
    }
  }
}