#include <bits/stdc++.h>
#define vi vector<int>
#define ve vector
#define ll long long
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define ii pair<int,int>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF 1e9
#define eps 1e-7
#define eps1 1e-2
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 1e5+5
using namespace std;
const int MOD = 1e9+7;
const int nax = 2*1e3+5;
double PI=3.14159265359;
int arx[8]={1,1,0,-1,-1,-1, 0, 1};
int ary[8]={0,1,1, 1, 0,-1,-1,-1};
typedef complex<int> Point;
#define X real()
#define Y imag()
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
int main(){
optimise;
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif*/
//setIO("nocross");
int n,k;
cin>>n>>k;
vi tab(n);
for (int i = 0; i < n; ++i)
{
cin>>tab[i];
}
vi pre(n,0);
vi dp(n,1e9+5);
int longest=0;
for(int i=0;i<n;i++)
{
int j=lower_bound(dp.begin(),dp.end(),tab[i])-dp.begin();
dp[j]=tab[i];
pre[i]=j+1;
longest=max(longest,pre[i]);
}//cout << longest<<endl;
dp.assign(n,1e9+5);
for (int i = n-1; i >= 0; --i)
{
int j=lower_bound(dp.begin(),dp.end(),-tab[i]+k)-dp.begin();//cout<<j<<endl;
longest=max(longest,pre[i]+j);
j=lower_bound(dp.begin(),dp.end(),-tab[i])-dp.begin();
dp[j]=-tab[i];
}cout <<longest<<endl;
}
