//
// Created by DELLPC on 2023/11/3.
//
#include "bits/stdc++.h"

using namespace std;

using ll = long long;
using ull = unsigned long long;
#define irep(i, l, r) for(int i = l; i <= r; ++ i)
#define IOS ios::sync_with_stdio(0);cin.tie(0);
#define endl "\n"
#define yes cout<<"YES"<<endl;
#define no cout<<"NO"<<endl;
#define lowbit(x) x&(-x)

void solve() {
    ll ans = 0;
    int n, k;
    cin >> n >> k;
    if(k == 0)k = 1e9;
    vector<int> arr(n), ord;

    irep(i, 0, n - 1) {
        cin >> arr[i];
    }
    ord = arr;
    sort(ord.begin(), ord.end());
    ord.erase(unique(ord.begin(), ord.end()), ord.end());
    map<int, int> mp;
    int tot = 0;
    for (int x : ord) {
        mp[x] = tot++;
    }
    vector<vector<int>> pre(tot);
    irep(i, 0, n - 1) {
        pre[mp[arr[i]]].emplace_back(i);
    }
//    cerr << tot << endl;
    irep(i, 0, tot - 1) {
        ll sum = pre[i].size(), dt = 0;
        ans = max(ans, sum);
        //ans = max(ans,(ll) pre[i].size());

        int x = ord[i];
        int y = x - k;
        if (mp.find(y) == mp.end())continue;
        int idy = mp[y];


    //    cerr << endl << idy << endl;
        int l = -1;
        for (auto r: pre[i]) {
            int cnt =
                    upper_bound(pre[idy].begin(), pre[idy].end(), r) - upper_bound(pre[idy].begin(), pre[idy].end(), l);
            dt = max(dt, 1ll * cnt);
            l = r;
        }

        int cnt = pre[idy].end() - upper_bound(pre[idy].begin(), pre[idy].end(), l);
    //    cerr << x << ' ' << max(dt, cnt * 1ll) << ' ' << sum <<endl;
        ans = max(ans, max(dt, cnt * 1ll) + sum);
    }
    cout << ans;
}

/*
 *
 *
5 2
2 2 4 4 4

7 1
3 2 3 2 2 2 3



7 1
2 3 2 3 2 3 3

 9 -100
-1 -2 1 2 -1 -2 1 -2 1

 7 0
9 9 9 7 9 9 9

 7 1
 404 487 223 222 222 222 222

 */

int main() {
    IOS
    int t = 1;

    while (t--)solve();
}