#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll PS[100001];
int besthub(int N, int M, int X[], ll K)
{
for(int i = 1; i <= N; i++) PS[i] = X[i - 1] + PS[i - 1];
int l = 2, r = N, s, ret = 1;
auto OK = [&]()
{
for(int i = s - 1; i < N; i++)
{
int med = (i - s + 1 + i) >> 1;
ll temp = (PS[i + 1] - PS[med + 1]) - (PS[med] - PS[i - s + 1]) - !(s & 1) * X[med];
if(temp <= K) return true;
}
return false;
};
while(l <= r)
{
s = (l + r) >> 1;
if(OK()) {l = s + 1; ret = s;}
else r = s - 1;
}
return ret;
}
//int main()
//{
// int n, m;
// ll k;
// cin >> n >> m >> k;
// int x[n];
// for(int i = 0; i < n; i++) cin >> x[i];
// cout << besthub(n, m, x, k) << '\n';
// return 0;
//}
