#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "ricehub.h"
int n;
VI a;
ll B;
int solve(int x, ll B) {
int ret = 0;
int r = upper_bound(all(a), x) - a.begin();
int l = r-1;
while (l >= 0 && r < n) {
if (a[r]-x < x-a[l]) {
if ((B -= a[r]-x) < 0) break;
r++;
ret++;
} else {
if ((B -= x-a[l]) < 0) break;
l--;
ret++;
}
}
while (r < n) {
if ((B -= a[r]-x) < 0) break;
r++;
ret++;
}
while (l >= 0) {
if ((B -= x-a[l]) < 0) break;
l--;
ret++;
}
return ret;
}
int besthub(int R, int L, int X[], ll BVAL) {
n = R;
a = VI(n);
B = BVAL;
rep(i, n) a[i] = X[i];
int ans = 0;
rep(i, n) setmax(ans, solve(a[i], B));
return ans;
}
