rt，CF record

#include<bits/stdc++.h>
using namespace std;
int a[200005];
long long p1[200005],p2[200005];
int main(){
	int t,n;
	long long k;
	scanf("%d",&t);
	while(t--){
		p1[0]=p2[n+1]=0;
		scanf("%d%lld",&n,&k);
		for(int i=1;i<=n;i++) scanf("%d",&a[i]);
		for(int i=1;i<=n;i++) p1[i]=p1[i-1]+a[i],p2[n-i+1]=p2[n-i+2]+a[n-i+1];
		int l=1,r=n;
		while(l<=n&&p1[l]<=(k+1)/2) l++;
		while(r>=1&&p2[r]<=k/2) r--;
		if(p1[n]<=k) printf("%d\n",n);
		else printf("%d\n",min(l-1+n-r,n));
	}
	return 0;
}