#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<cstdlib>
#include<queue>
#include<vector>
#define ll long long
using namespace std;
int n,k,a[50010],shu[50010],ans=0;
int main()
{
	cin>>n>>k;
	for(int i=1;i<=n;i++)cin>>a[i];
	sort(a+1,a+n+1);
	int l=1,r=1,cnt=0,maxx=-9999;
	while(r<=n)
	{
		while(a[r]-a[l]<=k&&r<=n)r++;
		shu[r]=max(shu[r],r-l);
		maxx=max(maxx,shu[l]);
		ans=max(ans,maxx+r-l);
		l++;
	}
	cout<<ans<<endl;
	return 0;
}