//In the name of God
#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll maxn = 2e5 + 100;
const ll mod = 1e9 + 7;
const ll INF = 1e18;
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io freopen("input.txt", "r+", stdin);freopen("output.txt", "w+", stdout);
#define pb push_back
#define Mp make_pair
#define F first
#define S second
#define Sz(x) ll((x).size())
#define all(x) (x).begin(), (x).end()
vector<ll> vec;
ll ps[maxn];
ll sp[maxn];
map<ll, ll> cnt;
int besthub(int n, int L, int X[], ll B){
vec.pb(0);
for(int i = 0; i < n; i++){
cnt[X[i]]++;
if(vec.back() != X[i]){
vec.pb(X[i]);
}
}
vec.pb(L + 1);
for(int i = 1; i < Sz(vec); i++){
ps[i] = ps[i - 1] + cnt[vec[i]];
sp[i] = sp[i - 1] + 1ll * cnt[vec[i]] * vec[i];
}
ll ans = 0;
for(int i = 1; i + 1 < Sz(vec); i++){
int l = 0, r = L + 10, mid;
while(r - l > 1){
mid = (l + r) >> 1;
int ir = lower_bound(all(vec), vec[i] + mid) - vec.begin();
int il = upper_bound(all(vec), vec[i] - mid) - vec.begin();
if((sp[ir - 1] - sp[i] - (ps[ir - 1] - ps[i]) * vec[i]) + ((ps[i] - ps[il - 1]) * vec[i] - (sp[i] - sp[il - 1])) <= B){
l = mid;
}
else r = mid;
}
int ir = lower_bound(all(vec), vec[i] + l) - vec.begin();
int il = upper_bound(all(vec), vec[i] - l) - vec.begin();
ll x = (B - ((sp[ir - 1] - sp[i] - (ps[ir - 1] - ps[i]) * vec[i]) + ((ps[i] - ps[il - 1]) * vec[i] - (sp[i] - sp[il - 1])))) / l;
ans = max(ans, ps[ir - 1] - ps[il - 1] + min(x, cnt[vec[i] - l] + cnt[vec[i] + l]));
}
return ans;
}
