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

int quadri(int N, long long M, int V[]) {

    int boh = 0;
    int left= 0, right = 0;
    long long sum = 0;
    for(right = 0; right < N; right++){
        sum += V[right];
        while(left <= right && sum > M){
            sum -= V[left++];
        }
        boh = max(boh, right-left);
            
    }
    return boh;
    

}