#include<bits/stdc++.h>
// #pragma GCC target ("avx,avx2,fma")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
typedef long long ll;
typedef long double ld;
#define SPEED ios_base::sync_with_stdio(false); cin.tie(0), cout.tie(0)
#define rall(v) (v).rbegin(),(v).rend()
#define all(v) (v).begin(),(v).end()
#define OK cerr<<"OK"<<endl<<flush
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define F first
#define S second
#define y0 jahdakdh
#define y1 jahsadakdakdh
#define endl '\n'
using namespace std;
const ll MOD=1e9+7;
// mt19937 rng(std::chrono::system_clock::now().time_since_epoch().count());
int n, x, a[200005], ans, v[200005];
int bs(int l, int r, int k)
{
ll mid;
while(l<=r)
{
mid=(l+r)>>1;
if(v[mid]>=k) r=mid-1;
else l=mid+1;
}
return l;
}
int LIS()
{
v[0]=a[0];
int p=1;
for(ll i=1; i<n; i++)
{
if(a[i]>v[p-1]) v[p++]=a[i];
else v[bs(0,p,a[i])]=a[i];
}
return p;
}
int main()
{
SPEED;
cin>>n>>x;
for(int i=0; i<n; i++)
cin>>a[i];
ans=LIS();
for(int d=-x; d<=-x; d++)
{
for(int s=1; s<=n; s++)
{
// [i, i+s-1]
for(int i=0; i+s-1<n; i++)
{
for(int j=i; j<=i+s-1; j++)
a[j]+=d;
ans=max(ans, LIS());
for(int j=i; j<=i+s-1; j++)
a[j]-=d;
}
}
}
cout<<ans<<endl;
return 0;
}
