#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+20];
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 f=0;
		for(auto p:nums[it.first]){
			if(p==it.first&&f&&cnt){
				cnt--;
			}
			else if(p!=it.first)
				cnt++,f=1;
			ans=max(ans,cnt);
		}
	}
	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;
}