#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N;
ll K;
int A[1010];

vector<int> hoge(vector<int> A,ll K) {
	if(A.size()==1 || A[0]<=0) return A;
	
	ll go=(K+A[0])/(A[0]+1);
	vector<int> B=A;
	B.erase(B.begin());
	FORR(b,B) b--;
	vector<int> R=hoge(B,K-go);
	FORR(b,R) b++;
	ll lef=K%(A[0]+1);
	int pos=(lef==0?0:(A[0]+1-lef));
	R.insert(R.begin()+pos,A[0]);
	return R;
	
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>K;
	vector<int> A(N);
	FOR(i,N) cin>>A[i];
	
	auto B=hoge(A,K);
	FORR(b,B) cout<<b<<" ";
	cout<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}