#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxn=2e5+;

int n,m,ans[maxn];

struct node{

    int val,id,rk;

}a[maxn];

bool cmp1(node x,node y){

    return x.val<y.val;

}

bool cmp2(node x,node y){

    return x.id<y.id;

}

ll sum[maxn],num[maxn];

int Ans;

int lowbit(int x){

    return x&(-x);

}

void add(int x,ll val){

    while(x<=n){

        num[x]++;

        sum[x]+=val;

        x+=lowbit(x);

    }

}

ll ask(int x){

    ll res=;

    while(x){

        Ans+=num[x];

        res+=sum[x];

        x-=lowbit(x);

    }

    return res;

}

int main(){

    int t;

    scanf("%d",&t);

    while(t--){

        memset(num,,sizeof(num));

        memset(sum,,sizeof(sum));

        scanf("%d%d",&n,&m);

        for(int i=;i<=n;i++){

            scanf("%d",&a[i].val);

            a[i].id=i;

        }

        sort(a+,a++n,cmp1);

        for(int i=;i<=n;i++)

            a[i].rk=i;

        sort(a+,a++n,cmp2);

        ll tmp=;

        for(int i=;i<=n;i++){

            tmp+=a[i].val;

            if(tmp<=m)ans[i]=;

            else{

                ll x=tmp-m;

                int l=,r=n;

                Ans=;

                ll s1=ask(n); ll Ans1=Ans;

                while(l<=r){

                    int mid=l+r>>;

                    Ans=;

                    ll s2=ask(mid); ll Ans2=Ans;

                    if(s1-s2>=x){

                        ans[i]=Ans1-Ans2;

                        l=mid+;

                    }else r=mid-;

                }

            }

        //    cout<<a[i].rk<<" "<<a[i].val<<endl;

            add(a[i].rk,a[i].val);

        }

        for(int i=;i<=n;i++)

            printf("%d ",ans[i]);

        printf("\n");

    }

    return ;

}