#include<cstdio>#include<cstring>#include<cctype>#include<algorithm>using namespace std;#define rep(i,s,t) for(int i=s;i<=t;i++)#define dwn(i,s,t) for(int i=s;i>=t;i--)#define clr(x,c) memset(x,c,sizeof(x))#define lson l,mid,x<<1#define rson mid+1,r,x<<1|1int read(){	int x=0;char c=getchar();	while(!isdigit(c)) c=getchar();	while(isdigit(c)) x=x*10+c-‘0‘,c=getchar();	return x;}const int nmax=1e5+5;int a[nmax],mx[nmax<<2],pos[nmax<<2],sm[nmax<<2];void pushup(int x){	int a=x<<1,b=x<<1|1;	sm[x]=sm[a]+sm[b];	if(mx[a]<mx[b]) mx[x]=mx[b],pos[x]=pos[b];	else mx[x]=mx[a],pos[x]=pos[a];}void build(int l,int r,int x){	if(l==r){		mx[x]=a[l],pos[x]=l,sm[x]=1;return ;	}	int mid=(l+r)>>1;build(lson);build(rson);	pushup(x);}struct node{	int mx,pos;	node(int mx,int pos):mx(mx),pos(pos){};	node(){};};int query(int l,int r,int x,int p){	if(l==r) return l;	int mid=(l+r)>>1;	if(p<=sm[x<<1]) return query(lson,p);	return query(rson,p-sm[x<<1]);}int query_sm(int l,int r,int x,int tl,int tr){	if(tl<=l&&tr>=r) return sm[x];	int mid=(l+r)>>1,ans=0;	if(tl<=mid) ans+=query_sm(lson,tl,tr);	if(tr>mid) ans+=query_sm(rson,tl,tr);	return ans;}node query_mx(int l,int r,int x,int tl,int tr){	if(tl<=l&&tr>=r) return node(mx[x],pos[x]);	int mid=(l+r)>>1;node ans=node(0,0),t;	if(tl<=mid) ans=query_mx(lson,tl,tr);	if(tr>mid) {		t=query_mx(rson,tl,tr);		if(t.mx>ans.mx) ans=t;	}	return ans;}void del(int l,int r,int x,int p){	if(l==r) mx[x]=pos[x]=sm[x]=0;	else{		int mid=(l+r)>>1;		p<=mid?del(lson,p):del(rson,p);		pushup(x);	}}int main(){	int n=read(),m=read();	rep(i,1,n) a[i]=read();	build(1,n,1);	int cur=1,u,v,d,tmp,temp,cnt=0;node o;	rep(i,1,n){		if(++cnt>n) break;		u=query(1,n,1,m+1);		o=query_mx(1,n,1,i,u);		printf("%d\n",o.mx);		del(1,n,1,o.pos);		m-=query_sm(1,n,1,1,o.pos);		if(o.pos!=i) --i;	}	return 0;}