#include <iostream>
#include <vector> 
#include <map>
using namespace std ; 
int solve(vector<int> q  ){
    int final_ans = 0; 
    int sum = 0 , sz = q.size(); 
    for(int i = 0 ; i < sz ; i ++){
      if(q[i] == -1) sum ++ ;  
    }
    int s[sz + 1] ; 
    for(int i = 0 ; i < sz ; i ++ ){
        if(i == 0) s[0] = q[0] ; 
        else s[i] = s[i - 1] + q[i] ;   
    }
    int minn[sz + 1] ; 
    for(int i = 0 ; i < sz ; i ++ ){
        if(i == 0 ) minn[i] = 0 ; 
        else minn[i] = min(minn[i-1] , s[i]) ; 
        // cout << minn[i] << ' ' <<
        
        final_ans = max(final_ans , sum + s[i] - minn[i]) ;        
    }
    
    return final_ans ; 
}
int main(){
    map<int , vector<int> > q ; 
    int n , k ; cin >> n >> k ;
    vector <int> a(n) ; 
    for(int i = 0 ; i < n ; i ++ ){
        cin >> a[i] ; 
        q[a[i]].push_back(-1) ; 
        q[a[i] + k].push_back(1) ; 
        // 1 是正主 ,  2 还要转化  
    }
    int ans = 0 ;  
    for(int i = -2e6 ; i <= 2e6 ; i ++ ){
        // if(q[i].size()) cout << q[i].size() << endl; 
       if(q.count(i)== false) continue ;  
       ans = max(solve(q[i]) , ans) ; 
    }
    cout << ans << endl ; 

    return 0 ; 
}