#include<bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
typedef pair<int, int> PII;
typedef long long ll;

constexpr int N = 1e6 + 10;
int n, k;
int a[N];
vector<int> v[4 * N];
vector<PII> p[4 * N];
unordered_map<int, int> mp;

void solve(){
    int ans = 1;
    cin >> n >> k;
    for(int i = 1; i <= n; i ++){
        cin >> a[i];
        a[i] += N;
        mp[a[i]] ++;
    }
    for(auto it : mp)
        ans = max(ans, it.second);
    for(int i = 1; i <= n; i ++){
        v[a[i]].push_back(-1);
        v[a[i] + k].push_back(1);
    }
    if(!k)
        return;
        
    for(int i = 1; i <= n; i ++){
        int j = a[i] + k;
        int tot = v[j].size();
        if(!tot)
            continue;
        ans = max(ans, mp[j] + v[j][0]);
        vector<int> sum(tot + 1);
        vector<int> summin(tot + 1);
        sum[1] = v[j][0];
        summin[1] = min(0ll, sum[1]);
        for(int k = 2; k <= tot; k ++){
            sum[k] = sum[k - 1] + v[j][k - 1];
            summin[k] = min(summin[k - 1], sum[k]);
            ans = max(ans, sum[k] - summin[k - 1] + mp[j]);
        }
    }

    cout << ans << endl;
}

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