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

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