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

            start = mid;
        }
        else {
            end = mid;
        }
    }
    return mid-1;
}