#include <bits/stdc++.h>
using namespace std;
#define uint unsigned long long
#define int long long
#define endl '\n'
const int N = 2e6 + 5;
typedef pair<int, int> PII;
#define MAX LONG_LONG_MAX
int ar[N];
int num[2 * N];
int pre[N], back[N];
void solve()
{
    int n, m, ans = 0;
    cin >> n >> m;
    vector<vector<int>> v(2 * N);

    for (int i = 1; i <= n; i++)
    {
        cin >> ar[i];
        v[ar[i] + N].push_back(i);
        num[ar[i] + N]++;
        pre[i] = num[ar[i] + N];
        ans = max(ans, num[ar[i] + N]);
    }
    memset(num, 0, sizeof num);

    for (int i = n; i; i--)
    {
        num[ar[i] + N]++;
        back[i] = num[ar[i] + N];
    }

    for (int i = 1; i <= n; i++)
    {
        auto l = upper_bound(v[ar[i] - m + N].begin(), v[ar[i] - m + N].end(), i);
        auto r = v[ar[i] - m + N].end();
        if (l != r)
        {
            r--;
            auto idxs = upper_bound(v[ar[i] + N].begin(), v[ar[i] + N].end(), *r);
            ans = max(ans, pre[i] + back[*l]);
            if (r != l && idxs != v[ar[i] + N].end() && (*r) < (*idxs))
                ans = max(ans, pre[i] + back[*l] + back[*idxs]);
        }
         l = upper_bound(v[ar[i] + m + N].begin(), v[ar[i] + m + N].end(), i);
        r = v[ar[i] + m + N].end();
        if (l != r)
        {
            r--;
            auto idxs = upper_bound(v[ar[i] + N].begin(), v[ar[i] + N].end(), *r);
            ans = max(ans, pre[i] + back[*l]);
            if (r != l && idxs != v[ar[i] + N].end() && (*r) < (*idxs))
                ans = max(ans, pre[i] + back[*l] + back[*idxs]);
        }
    }

    cout << ans << endl;
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);

    solve();
    return 0;
}