#include "ricehub.h"
#include<bits/stdc++.h>
const int N = 2e5 + 5;
#define ll long long
using namespace std;
ll a[N], pre[N], n, m, x, y;
ll calc(int x, int y) {
ll ans = 0;
int t = (x + y) / 2;
ans += (t-x+1) * a[t] - pre[t] + pre[x-1];
ans += pre[y] - pre[t] - (y-t) * a[t];
return ans;
}
int besthub(int R, int L, int X[], long long B) {
n = R;
for(int i = 1; i <= n; i++) {
a[i] = X[i-1];
pre[i] = pre[i-1] + a[i];
}
int j = 0, ans = 0;
ll p = B;
for(int i = 1; i <= n; i++) {
while(calc(i, j+1) <= p && j + 1 <= n) j++;
ans = max(ans, j - i + 1);
}
return ans;
}
