#include<bits/stdc++.h>
using namespace std;
int a[501000];
int main(){
    int n,k,ans;
    cin>>n>>k;
    for(int i=1;i<=n;i++)
    cin>>a[i];
    sort(a+1,a+n+1);
    int head=1,tail=1;
    ans=1;
    while(tail<n){
        tail++;
        while(a[tail]-a[head]>k)
             head++;
        if(tail-head+1>ans)
           ans=tail-head+1;
    }
    for(int i=tail+1;i<=n;i++){
    	a[i-ans]=a[i];
	}
	head=1,tail=1;
    int ans1=1;
    while(tail<n-ans){
        tail++;
        while(a[tail]-a[head]>k)
             head++;
        if(tail-head+1>ans1)
           ans1=tail-head+1;
    }
    ans+=ans1;
    cout<<ans<<endl;
    return 0;
}