#include <bits/stdc++.h>
using namespace std;
using ll=long long;

int main() {
	// your code goes here
	ll n,k;
	cin>>n>>k;
	vector<ll>arr(n);
	for(ll i=0;i<n;i++){
		cin>>arr[i];
	}
	vector<pair<ll,ll>>b(2*n);
	ll u=0;
	for(ll i=0;i<n;i++){
		ll l=arr[i]-k;
		ll r=arr[i]+k;
		b[u].first=l;
		b[u].second=0;
		u++;
		b[u].first=r;
		b[u].second=1;
		u++;
	}
	ll c=0;
	sort(b.begin(),b.end());
	ll ans=0;
	for(ll i=0;i<b.size();i++){
		ll x=b[i].first;
		if(b[i].second==0){
			c++;
		
			ans=max(ans,c);
		}
		else{
			c--;
		}
	}
	cout<<ans<<endl;
	
	return 0;
}