<p><img src="https://s1.ax1x.com/2018/10/04/i3TDZF.gif" alt=""></p>
#include<bits/stdc++.h>
#define ll long long
#define endl '\n'
using namespace std;
const ll N=1e6+100;
struct node {
	ll pos,val;
}d[N];
ll n,m,dd[N],id[N],c[N],c1[N];
ll lowbit(ll x){
	return x&(-x);
}
ll ask(ll x){
	ll ret=0;
	for(ll i=x;i;i-=lowbit(i)) ret+=c[i];
	return ret;
}
void add(ll x,ll y){
	for(ll i=x;i<=N;i+=lowbit(i)) c[i]+=y;
}
ll ask1(ll x){
	ll ret=0;
	for(ll i=x;i;i-=lowbit(i)) ret+=c1[i];
	return ret;
}
void add1(ll x,ll y){
	for(ll i=x;i<=N;i+=lowbit(i)) c1[i]+=y;
}
ll T;
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	cin>>T;
	while(T--){
		cin>>n>>m;
		memset(c,0,sizeof c);
		memset(c1,0,sizeof c1);
		for(ll u=0,i=1;i<=n;++i){
			cin>>dd[i];
			d[i].val=dd[i];
			d[i].pos=i;
		}
		sort(d+1,d+n+1,[](node a,node b){return a.val<b.val;});
		for(ll i=1;i<=n;++i) id[d[i].pos]=i;
		for(ll i=1;i<=n;++i){
			ll maxx=m-dd[i];
			ll l=0,r=n,rt;
			while(l<=r){
				ll mid=l+r>>1;
				ll fp=ask(mid);
				if(fp<=maxx) {
					l=mid+1;
					rt=mid;
				}
				else r=mid-1;
			}
			ll pl=ask1(rt);
			cout<<i-pl-1<<' ';
			add1(id[i],1);
			add(id[i],dd[i]);
		}
		cout<<endl;
	}
}