#include <algorithm>

using namespace std;

int quadri(int N, long long M, int V[]) {
    long long sum =  0, j = 0, B = 1e13, q = 0;
    for (int i = 0; j < N; i++) {
        while (sum + V[j] <= M && j < N) {
            sum += V[j++];
            q++;
        }
        B = min(B, q);
        q--;
        sum -= V[i];
    }
    return B;
}