#include<bits/stdc++.h>
#define int long long
#define base 2000005
using namespace std;
const int N=2000005;
int n,k;
int a[1000005];
map<int,int> hx;
vector<int> nums[2*N];
void solve(){
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		cin>>a[i];a[i]+=base;
		hx[a[i]]++;
		nums[a[i]].emplace_back(a[i]);
		nums[a[i]+k].emplace_back(a[i]);
	}
	int ans=0;
	for(auto it:hx){
		int cnt=it.second;
		int jia=0,maxl=0;
		int f=it.first;
		for(auto p:nums[f]){
			if(p==f-k)
				jia++;
			else if(jia)
				jia--;
			maxl=max(maxl,jia);
		}
		ans=max(ans,cnt+maxl);
	}
	cout<<ans;
	return;
}
signed main() {
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("in.txt","r",stdin);
	//freopen("out.txt","w",stdout);
	int t=1;
//	cin>>t;
	while(t--){
		solve();
	}
    return 0;
}