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

const int N=1e6+9;
int n, k, t=2e6, cnt[N*4], ans=0;
vector<int> v[N*4];

void solve()
{
    cin >> n >> k;
    for (int i=1; i<=n; i++){
        int x;
        cin >> x;
        cnt[x+t]++;
        v[x+t].push_back(-1);
        v[x+k+t].push_back(1);
    }
    for (int i=0; i<=t*2; i++){
        if (v[i].empty()) continue;
        int mx=max(0, v[i][0]);
        for (int j=1; j<v[i].size(); j++){
            v[i][j]=max(v[i][j], v[i][j-1]+v[i][j]);
            mx=max(mx, v[i][j]);
        }
        ans=max(ans, cnt[i]+mx);
    }
    cout << ans << "\n";
}

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    int t = 1;
    // cin >> t;
    while(t--) solve();
    return 0;
}