#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll=long long;
using Graph=vector<vector<pair<int,int>>>;
#define MAX 100
#define MOD 998244353
#define INF 1000000000

int main(){
  int N;
  ll M,K;
  cin>>N>>M>>K;
  vector<ll> a(N);
  for(int i=0;i<N-1;i++){
    a[i]=(ll)i;
    M-=(ll)i;
  }
  a[N-1]=M;
  vector<ll> ans(N);
  for(int i=0;i<N;i++){
    if(K>=(ll)N-1-(ll)i){
      ans[i]=a[N-1-i];
      K-=(ll)N-1-(ll)i;
    }else{
      ll cnt=(ll)N-1-(ll)i;
      for(int j=0;j<N-i;j++){

        if(cnt==K){
          ans[i+j]=a[N-1-i];
          //cout<<i+j<<" "<<a[N-1-i]<<endl;
        }else if(cnt>K){
          ans[i+j]=a[j];
          //cout<<i+j<<" "<<a[j]<<endl;
        }else{
          ans[i+j]=a[j-1];
        }
        cnt--;
      }
      break;
    }
  }
  for(int i=0;i<N;i++){
    cout<<ans[i]<<endl;
  }
}