poj 3061

#include <iostream>
#include <numeric>
#include <algorithm>
int N, S;
int a[100001];
int tc;
int main()
{
    std::cin >> tc;
    for(int i = 0; i < tc; ++i)
    {
    
        std::cin >> N >> S;    
        int minLen = N;
        a[0] = 0;
        for(int j = 0; j < N; ++j)
        {
            std::cin >> a[j+1];
            a[j+1] += a[j];
        }
        if(a[N] < S )
        {
            std::cout << 0 << std::endl;
            continue;
        }
        
        for(int j = 1; a[j]+S <= a[N]; ++j)
        {
            int t = std::lower_bound(a+j, a+N+1, a[j]+S) - a;
            minLen = std::min(minLen, t - j);
        }
        std::cout << minLen << std::endl;
    }
            
    return 0;
}