#include <bits/stdc++.h>
using namespace std;


int quadri(int N, long long M, int V[]) {
    // Scrivete qui la vostra soluzione
    int B = 67;
    int L=1; int R=N;


    vector<int> precum (N+1,0);

    vector<int> bin (N+1,-1); 

    for (int i=1; i<N+1; i++){
        precum[i]+=V[i];
        precum[i]+=precum[i-1];
    }



    int cp=0;


    while (1){
        int mid = L+(R-L)/2;
        cp=0;
        for (int i=mid; i<=N; i++){
            if (precum[i]-precum[i-mid]>M){
                break;
            }
            else cp++;
        }


        if (cp==(N-mid+1)) {
            L=mid+1;
            bin[mid]=1;
        }
        else {
            R=mid-1;
            bin[mid]=0;
        }



        if (L>R){
            if (bin[mid]==1) return mid;
            else return mid-1;
        }
        

        
    }
    return B;
}