#include<bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
typedef pair<int, int> PII;
typedef long long ll;

constexpr int N = 1e6 + 10;
int n, k;
int a[N];
vector<int> v[4 * N];
vector<PII> p[4 * N];
unordered_map<int, int> mp;

void solve(){
    int ans = 1;
    cin >> n >> k;
    for(int i = 1; i <= n; i ++){
        cin >> a[i];
        a[i] += N;
        mp[a[i]] ++;
    }
    for(auto it : mp)
        ans = max(ans, it.second);
    for(int i = 1; i <= n; i ++){
        v[a[i]].push_back(a[i]);
        v[a[i] + k].push_back(a[i]);
    }
    for(int i = 1; i <= n; i ++){
        if(p[a[i] + k].empty()){
            PII t = {10 * N + 1, 0};
            for(auto it : v[a[i] + k]){
                if(t.first == 10 * N + 1){
                    t.first = it;
                    t.second = 1;
                    continue;
                }
                if(it == t.first)
                    t.second ++;
                else{
                    p[a[i] + k].push_back(t);
                    t = {it, 1};
                }
            }
            p[a[i] + k].push_back(t);
        }
    }
//    for(int i = 1; i <= n; i ++){
//        cout << a[i] + k << endl;
//        for(int j = 0; j < p[a[i] + k].size(); j ++){
//            auto t = p[a[i] + k][j];
//            cout << t.first << " " << t.second << endl;
//        }
//    }
    for(int i = 1; i <= n; i ++){
        int cnt = 0, tmp = 0;
        bool flag = false;
        for(int j = 0; j < p[a[i] + k].size(); j ++){
            auto t = p[a[i] + k][j];
            if(!flag && t.first == a[i] + k){
                continue;
            }
            if(t.first != a[i] + k){
                flag = true;
                cnt += t.second;
                tmp = max(tmp, cnt);
                continue;
            }
            if(j + 1 >= p[a[i] + k].size())
                break;
            if(p[a[i] + k][j + 1].second - p[a[i] + k][j].second >= 0){
                cnt += p[a[i] + k][j + 1].second - p[a[i] + k][j].second;
                cnt = max(cnt, p[a[i] + k][j + 1].second);
                tmp = max(tmp, cnt);
            }
            else{
                cnt = p[a[i] + k][j + 1].second;
                tmp = max(tmp, cnt);
            }
            j ++;
        }
        p[a[i] + k].clear();
        ans = max(ans, mp[a[i] + k] + tmp);
    }
    cout << ans << endl;
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    while(t --)
        solve();
    return 0;
}