Find the answer

 http://acm.hdu.edu.cn/showproblem.php?pid=6609

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
#include <unordered_map>
#include <cmath>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 8e19
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define pii pair<int,int>
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=2e5+9;
const int maxm=2e5+9;
const int mod=998244353;

ll a[maxn],mp[maxn];
int n,m;
ll num[maxn<<2],sum[maxn<<2];

void pushup(int rt)
{
    num[rt]=num[lson]+num[rson];
    sum[rt]=sum[lson]+sum[rson];
}

void build(int l,int r,int rt)
{
    if(l==r)
    {
        num[rt]=0;
        sum[rt]=0;
        return ;
    }
    int mid=(l+r)>>1;
    build(l,mid,lson);
    build(mid+1,r,rson);
    pushup(rt);
}

void update(int l,int r,int pos,int rt)
{
    if(l==r)
    {
        num[rt]++;
        sum[rt]+=mp[l];
        return ;
    }
    int mid=(l+r)>>1;
    if(pos<=mid) update(l,mid,pos,lson);
    else update(mid+1,r,pos,rson);
    pushup(rt);
}

int query(int l,int r,ll val,int rt)
{
    if(l==r)
    {
        return val/mp[l];
    }
    int mid=(l+r)>>1;
    if(sum[lson]>=val)
    {
        return query(l,mid,val,lson);
    }
    else
    {
        return num[lson]+query(mid+1,r,val-sum[lson],rson);
    }
}

int main()
{
    FAST_IO;

    //freopen("input.txt","r",stdin);


    int T;
    cin>>T;
    while(T--)
    {
        cin>>n>>m;
        for(int i=1;i<=n;i++)
        {
            cin>>a[i];
            mp[i]=a[i];
        }
        sort(mp+1,mp+1+n);
        int len=unique(mp+1,mp+1+n)-mp-1;

        build(1,len,1);

        ll tot=0;
        for(int i=1;i<=n;i++)
        {
            tot+=a[i];
            if(tot<=m)
            {
                cout<<0<<" ";
            }
            else
            {
                int ans=query(1,len,m-a[i],1);
                cout<<i-ans-1<<" ";
            }
            int pos=lower_bound(mp+1,mp+1+len,a[i])-mp;
            update(1,len,pos,1);
        }
        cout<<endl;
    }


    return 0;
}