#include <iostream>
#include <cstdio>
#include <utility>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cmath>
#include <set>
#include <stack>

#define test
#ifndef test
    freopen("in.in", stdin);
#endif

#define rint register int
#define ll long long
#define P pair<char, int> 
const int N = 2e6 + 50;

using namespace std;
int arr[N], s[N * 2];
vector<int> dic[N * 2];
void solution(){
    int n, k; scanf("%d%d", &n, &k);
    for(int i = 1; i <= n; i++){
        scanf("%d", &arr[i]);
        dic[arr[i] + N].push_back(-1);
        dic[arr[i] + k + N].push_back(1);
        s[arr[i] + N]++;
    }
    int ans = 0;
    for(int i = 0; i < 2 * N; i++){
        int maxnum = 0, minnum = 0, mxlabel = -1, mnlabel = -1, sub = 0;
        for(int j = 0; j < dic[i].size(); j++){
            if(j) dic[i][j] += dic[i][j - 1];
            if(dic[i][j] >= maxnum){
                sub += dic[i][j] - maxnum;
                maxnum = dic[i][j];
                mxlabel = j;
                if(mxlabel > mnlabel) sub = maxnum - minnum;
            }
            if(dic[i][j] < minnum){
                minnum = dic[i][j];
                mnlabel = j;
            }
        }
        ans = max(ans, s[i] + sub);
    }
    if(k == 0){
        ans = 0;
        for(int i = 0; i < 2 * N; i++) ans = max(ans, s[i]);
    }
    printf("%d", ans);
}

int main(){
    test
    int t = 1;
    //scanf("%d", &t);
    while (t--){
        solution();
        if(t) printf("\n");
    }
}