#include <bits/stdc++.h>
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
using namespace std;
#define int long long
#define vi vector<int>
#define vl vector<long long>
#define vii vector<pair<int,int>>
#define vll vector<pair<long long,long long>>
#define pb push_back
#define ll long long
#define ld long double
#define nl '\n'
#define boost ios::sync_with_stdio(false)
#define mp make_pair
#define se second
#define fi first
#define fore(i, y) for(int i = 0; i < y; i++)
#define forr(i,x,y) for(int i = x;i<=y;i++)
#define forn(i,y,x) for(int i = y; i >= x; i--)
#define all(v) v.begin(),v.end()
#define sz(v) (int)v.size()
#define clr(v,k) memset(v,k,sizeof(v))
#define rall(v) v.rbegin() , v.rend()
#define pii pair<int,int>
#define pll pair<ll , ll>
const ll MOD = 1e9 + 7;
const ll INF = 1e18 + 1;
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (gcd)
ll lcm(ll a , ll b) {return a * (b / gcd(a , b));} // least common multiple (lcm)
// HERE IS THE SOLUTION
int n , x;
signed main()
{
boost;
cin.tie(0);
cout.tie(0);
// freopen("io.txt" , "r" , stdin);
cin>>n>>x;
vi v(n);
fore(i , n)
{
cin>>v[i];
}
vi dpA(n , INT_MAX);
vi pref(n);
fore(i , n)
{
int cur = v[i];
int idx = lower_bound(all(dpA) , cur) - dpA.begin();
dpA[idx] = cur;
pref[i] = idx + 1;
}
int ans = pref[n - 1];
vi dpB(n , INT_MAX);
forn(i , n - 1 , 0)
{
int cur = v[i];
int idx = lower_bound(all(dpB) , -cur + x) - dpB.begin();
ans = max(ans , idx + pref[i]);
int pos = lower_bound(all(dpB) , -cur) - dpB.begin();
dpB[pos] = -cur;
}
cout<<ans<<nl;
}
