#include <bits/stdc++.h>

using namespace std;

constexpr int N = 1E6;
constexpr int inf = 1E9;

void solve () {
    int n, k;
    cin >> n >> k;

    vector <int> a (n + 1);
    vector <vector <int>> id2 (N * 2 + 1);
    for (int i = 0; i <= N * 2; i ++) {
        id2[i].push_back (0);
    }
    map <int, int> mp;
    for (int i = 1; i <= n; i ++) {
        cin >> a[i];
        a[i] += N;
        mp[a[i]] ++;
        id2[a[i]].push_back (i);
        if (a[i] + k >= 0 && a[i] + k <= 2 * N) {
            id2[a[i] + k].push_back (i);
        }
    }

    int ans = 0;

    int ttt = 0;
    for (auto [x, y] : mp) {
        ans = max (ans, y);
    }
    for (int i = 0; i <= N * 2; i ++) {
        // ttt += id2[i].size ();
        if (id2[i].size () == 1) {
            continue;
        }
        const int m = id2[i].size () - 1;
        vector <int> c (m + 1);
        vector <int> pre (m + 1), suf (m + 2);
        for (int j = 1; j <= m; j ++) {
            c[j] = c[j - 1] + (a[id2[i][j]] == i ? -1 : 1);
            pre[j] = pre[j - 1] + (a[id2[i][j]] == i);
        }
        vector <int> maxx (m + 2, -inf);
        for (int j = m; j >= 1; j --) {
            suf[j] = suf[j + 1] + (a[id2[i][j]] == i);
            maxx[j] = max (maxx[j + 1], c[j] + suf[j + 1]);
        }
        for (int j = 1; j <= m; j ++) {
            ans = max (ans, maxx[j] - c[j - 1] + pre[j - 1]);
        }
        // ttt += c.size ();
        // ttt += pre.size ();
        // ttt += suf.size ();
        // ttt += maxx.size ();
    }
    // cerr << ttt << '\n';

    cout << ans << '\n';
}

signed main () {
    ios::sync_with_stdio (false);
    cin.tie (nullptr);

    int T = 1;
    // cin >> T;

    while (T --) {
        solve ();
    }

    return 0;
}