#include <bits/stdc++.h>
#define ll long long
#define le node+node
#define ri node+node+1
#define mid (l+r)/2
using namespace std;
const int inf = 4e5+9;
int n,k,a[inf],cnt,tree[inf<<2],lis[inf],lds[inf];
map<int,int> mp;
void update(int node,int l,int r,int idx,int val){
if(l == r)
return void(tree[node] = max(tree[node],val));
if(idx <= mid)
update(le,l,mid,idx,val);
else
update(ri,mid+1,r,idx,val);
tree[node] = max(tree[le],tree[ri]);
}
int query(int node,int l,int r,int x,int y){
if(l>r || r<x || l>y || x>y)
return 0;
if(l>=x && r<=y)
return tree[node];
return max(query(le,l,mid,x,y),query(ri,mid+1,r,x,y));
}
int main(){
scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++)
scanf("%d",a+i),mp[a[i]],mp[a[i]-k+1];
for(auto &o:mp)
o.second = ++cnt;
for(int i=1;i<=n;i++){
lis[i] = 1 + query(1,1,cnt,1,mp[a[i]]-1);
update(1,1,cnt,mp[a[i]],lis[i]);
//cout<<lis[i]<<" ";
}
memset(tree,0,sizeof(tree));
for(int i=n;i>=1;i--){
lds[i] = 1 + query(1,1,cnt,mp[a[i]]+1,cnt);
update(1,1,cnt,mp[a[i]],lds[i]);
}
int ans = 0;
memset(tree,0,sizeof(tree));
for(int i=n;i>=1;i--)
ans = max(ans,lis[i] + query(1,1,cnt,mp[a[i]-k+1],mp[a[i]])),update(1,1,cnt,mp[a[i]],lds[i]);
cout<<ans<<endl;
}
