#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int quadri(int N, long long M, int V[]) {
    // Scrivete qui la vostra soluzione
    vector<ll> prefix(N,0);
    prefix[0]=V[0];
    for(int i = 1;i<N;i++){
        prefix[i]=prefix[i-1]+V[i];
    }
    ll l=0,r=N;
    while(l<r){
        bool check = false;
        ll m = (l+r)/2+1;
        for(int i=m-1;i<N;i++){
             //   cout<<i-m+1<<' '<<i<<' '<<m<<endl;
            if(prefix[i]-(i-m>0 ? prefix[i-m] : 0LL) > M){
              //  cout<<"works"<<endl;
                check = true;
                break;
            }
        }
        if(check)r=m-1;
        else l=m;
    }
    return l;
}