#include <iostream>
#include <vector>
#include <queue>
using namespace std;
using ll=long long;
int quadri(int n, long long k, int v[]) {
    int l=0,r=n+1;
    vector<ll> pref(n+1,0);
    for (int i=0;i<n;i++) pref[i+1]=pref[i]+v[i];
    while (r-l>1){
        ll att=0;
        int m=(l+r)/2;
        for (int i=m;i<=n;i++){
            att=max(att,pref[i]-pref[i-m]);
            if (att>=k) break;
        }
        if (att>=k) r=m;
        else l=m;
    }
    ll att=0;
    for (int i=l;i<=n;i++) att=max(att,pref[i]-pref[i-l]);
    
    if (att>=k) l--;
    else {
        if (l<n) l++;
        att=0;
        for (int i=l;i<=n;i++) att=max(att,pref[i]-pref[i-l]);
        if (att>=k) l--;
    }

    return l;
}