#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define rep(i, f, l) for(int i(f); i <= l; ++i)
#define per(i, f, l) for(int i(f); i >= l; --i)
const int N = 1e6 + 5;
int n,a[N],k;
vector<int>v[2*N];
void work() {
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		a[i]+=1e6;
		v[a[i]].push_back(i);
	}
	int ans=0;
	for(int i=0;i<=2e6;i++){
		if(v[i].size()==0)continue;
		if(i-k<0||i-k>2e6)continue;
		if(v[i-k].size()==0){
			int z=v[i].size();
			ans=max(ans,z);continue;
		}
		int l=0;
		int sz=v[i-k].size();
		int sum=v[i].size();
		int lin=v[i].size();
		while(v[i][l]<v[i-k][0])l++;
		sum++;
		ans=max(ans,sum);
		for(int j=1;j<sz;j++){
			while(v[i-k][j]>v[i][l]&&l<v[i].size())l++,sum--;
			if(sum<lin)sum=lin;
			sum++;
			ans=max(ans,sum);
		}
	}
	cout<<ans<<endl;
	return;
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
//	freopen("1.in", "r", stdin);
//	freopen("1.out", "w", stdout);
	int t = 1;
//	cin >> t;
	while (t--) {
		work();
	}
	return 0;
}