#include<iostream>
#include<algorithm>
#include<deque>
using namespace std;
int n,k,ans;
int a[50005];
deque<int> dq;
int main(){
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	sort(a+1,a+1+n);
	for(int i=1;i<=n;i++){
		while(!dq.empty()&&dq.front()<a[i]-k) dq.pop_front();
		dq.push_back(a[i]);
		ans=max(ans,(int)dq.size());
	}
	cout<<ans<<endl;
	return 0;
}