#include<bits/stdc++.h>
#define INF 10000000
using namespace std;
typedef long long ll;
int main(){
int T, n, time, t;
cin >> T;
while(T--){
cin >> n >> time;
priority_queue<int> q;
ll sum = 0;
for(int i = 0; i < n; i++){
cin >> t;
vector<int> v;
while(sum + t > time){ // sum + t <= time
sum -= q.top();
v.emplace_back(q.top());
q.pop();
}
cout << i - q.size() << " "; // t
v.emplace_back(t);
for(auto t : v){
q.push(t);
sum += t;
}
}
cout << endl;
}
return 0;
}
100%, 本来想的复杂点,后面发现暴力全部放回去也能过。gg