#include <bits/stdc++.h>
#define all(a) begin(a), end(a)
#define sz(a) (int) (a).size()
#define int long long
using namespace std;
const int N=100050;
int n,k,a[N],ans;
vector<int> dis,pos[N];
vector<pair<int,int>> srt;
void solve() {
    cin>>n>>k;
    for (int i=1;i<=n;i++){
        cin>>a[i];
        dis.push_back(a[i]);
    }
    sort(all(dis));
    dis.erase(unique(all(dis)),dis.end());
    for (int i=1;i<=n;i++){
        a[i]=lower_bound(all(dis),a[i])-dis.begin();
        pos[a[i]].push_back(i);
    }
    for (int i=0;i<dis.size();i++){
        ans=max(ans,(int)pos[i].size());
        if (!binary_search(all(dis),dis[i]-k)) continue;
        int curr=0,ps=0;
        srt.clear();
        for (int j:pos[i]) srt.push_back({j,-1});
        int id=lower_bound(all(dis),dis[i]-k)-dis.begin();
        for (int j:pos[id]) srt.push_back({j,1});
        sort(all(srt));
        for (auto j:srt){
            ps+=j.second;
            ps=max(ps,0LL);
            curr=max(curr,ps);
        }
        ans=max(ans,(int)(curr+pos[i].size()));
    }
    cout<<ans<<"\n";
}

int32_t main() {
    cin.tie(0)->sync_with_stdio(false);

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