#include<bits/stdc++.h>
#define ll long long
#define pii pair<ll,ll>
#define lowbit(x) (x&-x)
#define log(x) (31^__builtin_clz(x))
using namespace std;
vector<int>l[1000005<<1];
int a[1000005];
void solve(){
    int n,k;
    cin>>n>>k;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        a[i]+=1e6;
        l[a[i]].push_back(i);
    }
    int ans=0;
    for(int i=1;i<=2e6;i++){
        ans=max(ans,(int)l[i].size());
        if(i+k<1||i+k>2e6||k==0)continue;
        vector<int>t;
        int now=0;
        for(auto u:l[i]){
            while(now<l[i+k].size()&&l[i+k][now]<u){
                t.push_back(-1);
                now++;
            }
            t.push_back(1);
        }
        while(now<l[i+k].size()){
            t.push_back(-1);
            now++;
        }
        int mn=0,siz=l[i+k].size();
        for(int i=0;i<t.size();i++){
            if(i)t[i]+=t[i-1];
            ans=max(ans,t[i]-mn+siz);
            mn=min(mn,t[i]);
        }
    }
    cout<<ans<<"\n";
}
int main(){
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t=1;
    // cin>>t;
    while(t--)solve();
    return 0;
}