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

int quadri(int n, long long m, int v[]) {
    // n quadri
    // m max
    // v arr of q

    int b = INT_MAX;
    // add current
    // while above limit remove
    // set if lower
    ll sum = 0;
    int l = 0;
    int len = 0;
    int i = 0;
    while (i < n) {
        while (sum <= m && i < n) {
            // cout << "s(" << sum << "+" << v[i]<<"="<< sum+v[i]<<"   len: "<<len << ">"<<len+1<<"\n";
            sum += v[i];
            len++;
            i++;
        }

        while (sum > m && l <= i) {
            // cout << "s(" << sum << "-"<<v[l]<<"="<<sum-v[l]<<"   len: "<<len << ">"<<len-1<<"\n";
            sum -= v[l];
            l++;
            len--;
        }

        // cout << "saved "<<b <<" " <<len<<"\n";
        b = min(b, len);
    }

    return b;
}