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

struct Node{
	int l, r;
	int cnt;
	bool flag;
	Node():flag(0){}
};

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);

	int n, k;
	cin >> n >> k;

	int idx = 0;
	map<int, int>mp;
	map<int, int>cntt;
	map<int, int>id;

	vector<int>v(n);
	for(int i = 0; i < n; i++) {
		cin >> v[i];
		if(mp.count(v[i]) == 0) {
			mp[v[i]] = idx++;
			id[idx - 1] = v[i];
			cntt[mp[v[i]]] = 0;	
		}
		cntt[mp[v[i]]]++;
	}
	
	// for(int i = 0; i < idx; i++)
	// {
	// 	cout << id[i] << " " << cntt[i] << endl;
	// }

	if(k == 0) {
		int ans = 0;
		for(int i = 0; i < idx; i++)
			ans = max(ans, cntt[i]);
		cout << ans << endl;
		return 0;
	}
	
	auto f =[&](vector<Node>&v2){
	for(int i = 0; i < n; i++)
	{
		int l = i, r = i + 1;
		while(v[r] == v[l] && r < n)
			r++;

		if(v2[mp[v[l]]].flag)
		{
			
			int t = 0;
			// cout << i << " " << v2[mp[v[l]]].r << endl;
			for(int j = v2[mp[v[l]]].r; j < l; j++)
				if(v[j] == v[l] + k)
					t++;
			if(v2[mp[v[l]]].flag) {
				int x1 = v2[mp[v[l]]].cnt;
				int x2 = v2[mp[v[l]]].cnt + r - l - t;
				int x3 = r - l;

				if(x1 >= x2 && x1 >= x3) {
					continue;
				}
				else if(x2 >= x1 && x2 >= x3) {
					// cout << v2[mp[v[l]]].cnt << "**" << r - l << "**" << t << endl;
					v2[mp[v[l]]].r = r;
					v2[mp[v[l]]].cnt = x2;
				}
				else {
					v2[mp[v[l]]].l = l;
					v2[mp[v[l]]].r = r;
					v2[mp[v[l]]].cnt = x3;
				}
			}
		}

			else {
				v2[mp[v[l]]].flag = 1;
				v2[mp[v[l]]].l = l;
				v2[mp[v[l]]].r = r;
				v2[mp[v[l]]].cnt = r - l;
			}

		

		i = r - 1;
	}
};
	vector<Node>v2(idx), v3(idx);
	f(v2);
	reverse(v.begin(), v.end());
	f(v3);

	int ans = 0;
	for(int i = 0; i < idx; i++) {
		if(mp.count(id[i] - k)) {
			// cout << v2[mp[id[i] - k]].cnt << " " << v2[mp[id[i] - k]].cnt << endl;
			ans = max(ans, max(v2[mp[id[i] - k]].cnt, v3[mp[id[i] - k]].cnt) + cntt[i]);
		}
		else
			ans = max(ans, cntt[i]);
	}

	cout << ans << endl;




	return 0;
}