/*
* @Author: MaxPhast
* @File: test.cpp
* @Date: 2025-11-19 23:05:59
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int , int>
#define iii pair <int , ii>
#define iiii pair <ii , ii>
#define FOR(i , l , r) for(int i = (l) , _r = (r) ; i <= _r ; ++ i)
#define FORD(i , r , l) for(int i = (r) , _l = (l) ; i >= _l ; -- i)
#define ALL(vec) vec.begin() , vec.end()
#define UNI(vec) sort(ALL(vec)) , vec.erase(unique(ALL(vec)) , vec.end())
#define pb push_back
#define MASK(i) (1ll << i)
#define BIT(mask , i) ((mask >> i) & 1ll)
#define ON(mask , i) (mask | MASK(i))
#define OFF(mask , i) (mask & (~MASK(i)))
#define TURN(mask , i) (mask ^ MASK(i))
#define BP(mask) __builtin_popcountll(mask)
#define sqr(x) (1ll * (x) * (x))
#define fi first
#define se second
#define oo 1e18
#define time() cerr << " \n " << "Time : " << 1000.0 * clock() / CLOCKS_PER_SEC << "ms."
#define IO(TASK) if(fopen(#TASK".INP" , "r")){freopen(#TASK".INP" , "r" , stdin); freopen(#TASK".OUT" , "w" , stdout);}
template <class X , class Y>
bool maxz(X &a , const Y b)
{
if(a < b)
{
a = b;
return true;
}
return false;
}
template <class X , class Y>
bool minz(X &a , const Y b)
{
if(a > b)
{
a = b;
return true;
}
return false;
}
namespace MaxPhast
{
const int N = 2e5 + 5;
int n , x , ans;
int a[N] , f[N] , pref[N] , suff[N];
void solve()
{
cin >> n >> x;
FOR(i , 1 , n)
cin >> a[i];
FOR(i , 0 , n) f[i] = oo;
f[0] = -oo;
FOR(i , 1 , n)
{
int l = 0 , r = i - 1 , res = 0;
while(l <= r)
{
int mid = l + r >> 1;
if(f[mid] < a[i])
{
res = mid;
l = mid + 1;
}
else
r = mid - 1;
}
pref[i] = res + 1;
minz(f[res + 1] , a[i]);
}
FOR(i , 0 , n) f[i] = -oo;
f[0] = oo;
FORD(i , n , 1)
{
int l = 0 , r = n - i , res = 0;
while(l <= r)
{
int mid = l + r >> 1;
if(f[mid] > a[i])
{
res = mid;
l = mid + 1;
}
else
r = mid - 1;
}
suff[i] = res + 1;
maxz(f[res + 1] , a[i]);
}
FOR(i , 0 , n) f[i] = oo;
f[0] = -oo;
FOR(i , 1 , n)
{
int l = 0 , r = i - 1 , res = 0;
while(l <= r)
{
int mid = l + r >> 1;
if(f[mid] < a[i] + x)
{
res = mid;
l = mid + 1;
}
else
r = mid - 1;
}
maxz(ans , res + suff[i]);
minz(f[pref[i]] , a[i]);
}
FOR(i , 0 , n) f[i] = -oo;
f[0] = oo;
FORD(i , n , 1)
{
int l = 0 , r = n - i , res = 0;
while(l <= r)
{
int mid = l + r >> 1;
if(f[mid] > a[i] - x)
{
res = mid;
l = mid + 1;
}
else
r = mid - 1;
}
maxz(ans , res + pref[i]);
maxz(f[suff[i]] , a[i]);
}
cout << ans;
}
}
signed main()
{
ios_base :: sync_with_stdio(false) ; cin.tie(nullptr) ; cout.tie(nullptr) ;
IO(test);
MaxPhast :: solve();
time();
}
/*
*/
