#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e6 + 5;
int __t = 1, n, k, a[N];
unordered_map<int, vector<int>> mp;
unordered_map<int, int> sum;
void solve() {
    cin >> n >> k;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        sum[a[i]]++;
        mp[a[i]].push_back(-1);
        mp[a[i] + k].push_back(1);
    }
    int anss = 0;
    for (auto [x, v] : mp) {
        // 最大子段和
        int ans = 0, ma = 0;
        for (auto y : v) {
            ma = max(ma + y, 0ll);
            ans = max(ans, ma);
        }
        anss = max(anss, ans + sum[x]);
    }
    cout << anss << "\n";
    return;
}
int32_t main() {
#ifdef ONLINE_JUDGE
    ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    // cin >> __t;
    while (__t--)
        solve();
    return 0;
}