#include <bits/stdc++.h>

using namespace std;

using vi = vector<int>;


int main() {
    int n, k;
    cin >> n >> k;
    vi a(n + 1);
    map<int, vi> cnt;
    for (int i = 1; i <= n; i++)
        cin >> a[i], cnt[a[i]].push_back(i);

    auto lst = [&cnt](int x, int i) {
        if (cnt[x].empty()) return 0;
        auto it = lower_bound(cnt[x].begin(), cnt[x].end(), i);
        if (it == cnt[x].end()) return cnt[x].back();
        if (*it < i) return *it;
        if (it == cnt[x].begin()) return 0;
        return *prev(it);
    };

    vi pre(n + 1);
    for (int i = 1; i <= n; i++)
        pre[i] = pre[lst(a[i], i)] + 1;

    vi suf(n + 1);
    for (int i = n, j; i >= 1; i--) {
        suf[i]++, j = lst(a[i], i);
        if (j != 0) suf[j] += suf[i];
    }

//    for( int i = 1 ; i <= n ; i ++ )
//        cout << pre[i] << " ";
//    cout << "\n";
//
//    for( int i = 1 ; i <= n ; i ++ )
//        cout << suf[i] << " ";
//    cout << "\n";

    vi f(n + 1);
    for (int i = 1, j; i <= n; i++) {
        f[i] = pre[i], j = lst(a[i] - k, i);
        if (j != 0) f[i] -= pre[j];
    }

    vi g(n + 1);
    for (int i = 1; i <= n; i++)
        g[i] = max(f[i], g[lst(a[i], i)]);

    int res = 0;
    for (int i = 1, j, t; i <= n; i++) {
        t = suf[i], j = lst(a[i] - k, i);
        if (j != 0) t += pre[j], j = lst(a[i], j);
        if (j != 0) t += g[j];
        res = max(res, t);
    }
    cout << res << "\n";
    return 0;
}