int quadri(int N, long long M, int V[]) {
    int B = 0, l = 0, r = 0;
    long long s = 0;
    
    for(int i = 0; i < N; i++){
    	r = i;
    	s += V[i];
    	if(s > M) break;
	}
	if(r == N -1 && s <= M) return N;
	
	while(l < r && r < N){
		s -= V[l];
		if(s <= M){
			r++;
			l++;
			s += V[r];
		}else{
			l++;
		}
	}
	B = r - l;
    return B;
}