#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
const int N=5e4+5;
int n,k,a[N],l=1,mid=2,r=4,mid2=3,ans;
int main() {
cin>>n>>k;
for (int i=1; i<=n; i++) {
cin>>a[i];
}
sort(a+1,a+n+1);
for (int i=1; i<=n; i++) {
if(l<mid<mid2<r) {
if(a[mid]-a[l]<=k) {
while(a[mid]-a[l]<=k && mid<n) mid++;
}
else if(a[mid]-a[l]>k) l+=1;
}
if(l<mid<mid2<r){
if(a[r]-a[mid2]<=k && r<n) r++;
else if(a[r]-a[mid2]>k) mid2++;
}
ans=max(mid-l+r-mid2,ans);
}
cout<<ans;
return 0;
}
