#include <iostream>#include <vector>#include <string>#include <map>#include <algorithm>using namespace std;int main(){ int t, n, m; cin >> t; while (t--) { cin >> n >> m; vector<int> v(n ,0); for (int i = 0; i < n; i++) cin >> v[i]; cout << 0 << " "; vector<int> tmp; tmp.push_back(v[0]); for (int i = 1; i < n; i++) { int remain = m - v[i]; sort(tmp.begin(), tmp.end()); for (int j = 0; j < tmp.size(); j++) { if(j == tmp.size() - 1 && remain - tmp[j] >= 0) cout << 0 << " "; else if(remain - tmp[j] >= 0) remain -= tmp[j]; else{  cout << i - j <<  " "; break; } } tmp.push_back(v[i]); } cout << endl; } system("pause"); return 0;}