#include <bits/stdc++.h>

using namespace std;

const int N = 1e6 + 10, V = 4e6 + 10, P = 2e6;

int n, k, a[N], cnt[V], ans, c[V], mmax[V];

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    cin >> n >> k;
    for (int i = 1; i <= n; i++) cin >> a[i], a[i] += P;
    for (int i = 1; i <= n; i++) cnt[a[i]]++, c[a[i]]++;
    fill(mmax, mmax + V, -1e9);
    for (int i = n; i >= 1; i--) {
        // a[i] a[i] + k
        mmax[a[i]] = max(mmax[a[i]], cnt[a[i]] - cnt[a[i] + k]);

        // a[i] - k  a[i]
        mmax[a[i] - k] = max(mmax[a[i] - k], cnt[a[i] - k] - cnt[a[i]]);

        cnt[a[i]]--;

        if (i < n && mmax[a[i]] != -1e9) {
            ans = max(ans, cnt[a[i] + k] - cnt[a[i]] + mmax[a[i]] + c[a[i] + k]);
        }
        // cnt[r][a[i]] - cnt[l - 1][a[i]] + c[a[i] + k] - cnt[r][a[i] + k] + cnt[l - 1][a[i] + k]
    }
    cout << ans;
    return 0;
}