#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define endl '\n'

void solve(){
	int n;
	ll W;
	cin >> n >> W;
	if(n == 1){
		ll w;
		cin >> w;
		if(w <= W) cout << 1 << endl;
		else cout << 0 << endl;
		return;
	}
	vector<ll> w(n), F(n);
	F[0] = 1;
	F[1] = 2;
	for(int i = 0; i < n; i++){
		cin >> w[i];
		if(i >= 2) F[i] = F[i - 1] + F[i - 2];
	}

	reverse(w.begin(), w.end());
	reverse(F.begin(), F.end());

	map<pair<int, ll>, ll> memo;

	auto dfs=[&](auto self, int i, ll W) -> ll {
		if(i == n) return 0;
		else if(i == n - 1){
			if(W >= w[i]) return 1LL;
			else return 0LL;
		}

		if(memo.count({i, W})) return memo[{i, W}];

		if(w[i] > W){
			return self(self, i + 1, W);
		}
		else if(w[i + 1] > W){
			return self(self, i + 1, W - w[i]) + F[i];
		}
		else if(w[i] + w[i + 1] <= W){
			return self(self, i + 1, W - w[i]) + F[i];
		}
		ll ret = max(self(self, i + 2, W - w[i]) + F[i], self(self, i + 2, W - w[i + 1]) + F[i + 1]);
		memo[{i, W}] = ret;
		return ret;
	};

	ll ans = dfs(dfs, 0, W);
	cout << ans << endl;
}


int main(){
	cin.tie(0)->sync_with_stdio(0);

	int t = 1;
	cin >> t;
	while(t--) solve();
}