#include<algorithm>
#include<iostream>
#include<cstdio>
#include<vector>
using namespace std;
const int N = 1e6 + 5, pos = 2e6;
int n, K, siz, ans;
int num[N], a[N];
vector <int> v[N];

int main(){
    ios::sync_with_stdio(0),cin.tie(0);
    cin >> n >> K;
    for(int i = 1; i <= n; i ++){
        cin >> a[i];
        num[i] = a[i];
    }
    sort(num + 1, num + 1 + n);
    siz = unique(num + 1, num + 1 + n) - num - 1;
    for(int i = 1; i <= n; i ++){
        int x = lower_bound(num + 1, num + 1 + siz, a[i]) - num;
        // cout << "TEST!! " << i << " " << x << "\n";
        v[x].push_back(i);
    }
    num[siz + 1] = N * 10;
    for(int i = 1, j, k, maxn, temp; i <= siz; i ++){
        int to = lower_bound(num + 1, num + 1 + siz, num[i] + K) - num;
        // cout << "WTF?? " << to << '\n';
        ans = max(ans, (int)v[i].size());
        if(num[to] != num[i] + K){
            continue;
        }
        k = 0;
        maxn = -N;
        while(k < v[to].size() && v[to][k] < v[i][0]){
            ++k;
        }
        for(j = 1; j <= v[i].size(); j ++){
            temp = k - (j - 1);
            maxn = max(maxn, temp);
            ans = max(ans, j - k + maxn + (int)v[to].size());
            if(j == v[i].size()) break;
            while(k < v[to].size() && v[to][k] < v[i][j]){
                ++k;
            }
        }
    }
    cout << ans << endl;
    return 0;
}