#include <iostream>
#include <deque>
#include <algorithm>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)

int main(){
  ll N,M,K; cin >> N >> M >> K;
  deque<ll> A(N);
  rep(i,N) A[i] = i;
  A[N-1] += M - (N*(N-1)/2);
  deque<ll> ans;
  while(K != 0){
    if(ans.size() <= K){
      K -= ans.size();
      ans.push_front(A.front());
      A.pop_front();
    }
    else{
      ans.push_back(A.front());
      A.pop_front();
      int p = ans.size()-1;
      while(K != 0){
        K--;
        swap(ans[p-1],ans[p]);
        p--;
      }
    }
  }
  while(A.size()){
    ans.push_back(A.front());
    A.pop_front();
  }
  rep(i,N) cout << ans[i] << "\n";
  return 0;
}