#include <bits/stdc++.h>
using namespace std;
int quadri(int N, long long M, int* V){
    int start = 0;
    int end = N;
    int mid;
    int last = 0;
    int somma = 0;
    
    while (start<end){
        mid = (end+start)/2;
        int max_somma = 0;
        
        
        for (int i=0; i<mid; i++){
            max_somma += V[i];
        }
        for (int i =1; i<N-mid+1;i++){
            // cerr<<max_somma<<endl;
            max_somma = max(max_somma, (max_somma-V[i-1] + V[i+mid-1]));
            
        }
        // cerr<<start<<" "<<mid<<" "<<end<<endl;
        if (max_somma>=M){
            end = mid;
        }
        if (max_somma<M){
            start = mid;
        }

        if (mid == last) break;
        last = mid;
    }
    
    return mid;
}