#include <iostream>
using namespace std;
int main()
{ int t,n,arr[1000000];
cin>>t;
while(t--)
{ int at,bt;
cin>>at>>bt;int sum =0;int max_p = 0;
for(int i = 0;i<at;i++)
cin>>arr[i];
int j=0;
int max_route = 0;
for(int i =0;i<=at;) {
sum+=arr[i++];
if(sum>bt)
sum = sum - arr[j++];
else if(sum<=bt)
{
if((i-j-1) > max_route)
{ max_route = i-j-1;
max_p = sum;
}
}
}
cout<<max_p<<" "<<max_route<<endl;
}
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwppbnQgbWFpbigpCnsgaW50IHQsbixhcnJbMTAwMDAwMF07CmNpbj4+dDsKd2hpbGUodC0tKQogeyBpbnQgYXQsYnQ7CmNpbj4+YXQ+PmJ0O2ludCBzdW0gPTA7aW50IG1heF9wID0gMDsKZm9yKGludCBpID0gMDtpPGF0O2krKykKY2luPj5hcnJbaV07CiBpbnQgaj0wOwppbnQgbWF4X3JvdXRlID0gMDsKZm9yKGludCBpID0wO2k8PWF0OykgewoJc3VtKz1hcnJbaSsrXTsKIGlmKHN1bT5idCkKIHN1bSA9IHN1bSAtIGFycltqKytdOwogZWxzZSBpZihzdW08PWJ0KQogewogIGlmKChpLWotMSkgPiBtYXhfcm91dGUpCiAgeyBtYXhfcm91dGUgPSBpLWotMTsKICAgIG1heF9wID0gc3VtOwoKICAgfQogIAogfQp9CmNvdXQ8PG1heF9wPDwiICI8PG1heF9yb3V0ZTw8ZW5kbDsKfQpyZXR1cm4gMDsKfQoK