#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 P = 998244353;
const int N = 1e6 + 5;
int cnt[N << 2], qjcnt[N << 2];
void solve() {
    int n, k, ans = 0;
    cin >> n >> k;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        a[i] += 2 * N;
        cnt[a[i]]++;
        ans = max(ans, cnt[a[i]]);
    }
    for (int i = 0; i < n; i++) {
        qjcnt[a[i]] = max(qjcnt[a[i]] - 1, 0);
        qjcnt[a[i] + k]++;
        ans = max(ans, cnt[a[i] + k] + qjcnt[a[i] + k]);
    }
    cout << ans << '\n';
}
int main() {
    ios::sync_with_stdio(0); cin.tie(0), cout.tie(0);
    int t = 1; 
    // cin >> t;
    while(t--) solve();
    return 0;
}