#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define PII pair<int, int>
const int N = 3e6 + 5;
const int M = 1e5 + 5;
const int INF = 1e18 + 10;

int arr[N];
int tot[N];
int tag[N];

void solve()
{
    int n, k;
    cin >> n >> k;
    int gmax = 0;
    for (int i = 1; i <= n; i++)
    {
        cin >> arr[i];
        arr[i] += 1e6;
        tot[arr[i]]++;
        gmax = max(gmax, tot[arr[i]]);
    }
    if (k == 0)
    {
        cout << gmax << '\n';
        return;
    }

    int res = gmax;
    for (int i = 1; i <= n; i++)
    {
        tag[arr[i] + k]++;
        tag[arr[i]]--;
        if (tag[arr[i]] < 0)
            tag[arr[i]] = 0;

        res = max(res, tag[arr[i] + k] + tot[arr[i] + k]);
    }
    cout << res << '\n';
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    while (t--)
    {
        solve();
    }

    return 0;
}
/*
5 2
2 2 4 4 4

5

7 1
3 2 3 2 2 2 3

6

7 1
2 3 2 3 2 3 3

5

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

3

*/