#include <stdio.h>
int a[1000000];
int min(int x, int y)
{
return x = (x < y) ? x : y;
}
int solve(int n, int sum1)
{
int res, sum, t, s;
sum = t = s = 0;
res = n + 1;
for(; ;)
{
while(t < n && sum < sum1)
{
sum += a[t++];
}
if(sum < sum1) break;
res = min(res, t - s);
sum -= a[s++];
}
if(res > n)
{
return 0;
}else{
return res;
}
}
int main()
{
int num, n, sum1;
int i;
scanf("%d", &num);
while(num--)
{
scanf("%d %d", &n, &sum1);
for(i = 0; i < n; ++i)
{
scanf("%d", &a[i]);
}
printf("%d\n", solve(n, sum1));
}
return 0;
}
///更改于2014/4/13,尺取法