#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<vector>
#include<queue>
#include<stack>
#include<ctime>
#include<map>
#define pii pair<int,int>
#define pb push_back
#define LL long long
#define mp make_pair
#define fi first
#define se second
using namespace std;
inline int read(){
    int f=1,ans=0; char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
    while(c>='0'&&c<='9'){ans=ans*10+c-'0';c=getchar();}
    return f*ans;
}
const int MAXN=1e6+11;
int N,A[MAXN],tmp[MAXN],K; map<int,int> Ma;
vector<int> vec[MAXN];
int sta[MAXN],Maxn;
int main(){
    //freopen("1.in","r",stdin);
    N=read(),K=read(); for(int i=1;i<=N;i++) A[i]=tmp[i]=read(); 
    sort(tmp+1,tmp+N+1); int M=unique(tmp+1,tmp+N+1)-tmp-1;
    for(int i=1;i<=M;i++) Ma[tmp[i]]=i;
    for(int i=1;i<=N;i++) A[i]=lower_bound(tmp+1,tmp+M+1,A[i])-tmp,vec[A[i]].pb(i);
    //for(int i=1;i<=N;i++) cerr<<A[i]<<" ";cerr<<endl;
    for(int i=1;i<=M;i++){
        if(Ma[tmp[i]-K]==0){Maxn=max(Maxn,(int)vec[i].size()); continue;}
        int id=Ma[tmp[i]-K];
        int p1=0,p2=0; sta[0]=0;
        while(p1!=vec[i].size()&&p2!=vec[id].size()){
            if(vec[i][p1]<vec[id][p2]) sta[++sta[0]]=1,p1++;
            else sta[++sta[0]]=0,p2++;
        }
        //cerr<<"p1:"<<p1<<" "<<vec[i].size()<<" "<<i<<" "<<A[1]<<endl;
        while(p1!=vec[i].size()) sta[++sta[0]]=1,p1++;
        while(p2!=vec[id].size()) sta[++sta[0]]=0,p2++;
        int Sum=0;
        //cerr<<tmp[i]<<" "<<tmp[id]<<endl;
        //for(int j=1;j<=sta[0];j++) cerr<<sta[j]<<" ";cerr<<endl;
        for(int j=1;j<=sta[0];j++) Sum+=sta[j];//0->1 1->-1
        for(int j=1;j<=sta[0];j++){
            if(sta[j]==0) sta[j]=1;
            else sta[j]=-1;
        }
        int nmaxn=0,maxsum=0;
        for(int j=1;j<=sta[0];j++){
            nmaxn=max(nmaxn,maxsum+sta[j]);
            maxsum=max(maxsum+sta[j],sta[j]);
            maxsum=max(maxsum,0);
        }
        Sum+=nmaxn; Maxn=max(Maxn,Sum);
        //printf("%d\n",Sum);
        
    }printf("%d\n",Maxn);
}