//#pragma GCC optimize(2)
//#pragma GCC optimize(3,"Ofast","inline")
#include <bits/stdc++.h>

#define FOR(i, j, k) for(int i = (j);i <= (k);i ++)
#define ROF(i, j, k) for(int i = (j);i >= (k);i --)
#define For(i, j, k) for(int i = (j);i < (k);i ++)
#define Rof(i, j, k) for(int i = (j);i > (k);i --)
#define ull unsigned long long
#define PII pair<int,int>
#define ULL unsigned long long
#define db double
#define x first
#define y second
#define sp(x) fixed << setprecision(x)
#define all(x) x.begin(), x.end()
#define unq_all(x) x.erase(unique(all(x)), x.end())
#define M(x) x %= mod, x += mod, x %= mod
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define Yes cout << "Yes\n"
#define No cout << "No\n"
#define ANS cout << ans << '\n'
#define de(p) cout << #p << ' ' << p << '\n'
#define END(i, n) (i == n ? '\n' : ' ')
#define double long double

#define RED cout << "\033[91m"
#define GREEN cout << "\033[92m"
#define YELLOW cout << "\033[93m"
#define BLUE cout << "\033[94m"
#define MAGENTA cout << "\033[95m"
#define CYAN cout << "\033[96m"
#define RESET cout << "\033[0m"

// 红色
#define DEBUG1(x)                     \
    RED;                              \
    cout << #x << " : " << x << endl; \
    RESET;

// 绿色
#define DEBUG2(x)                     \
    GREEN;                            \
    cout << #x << " : " << x << endl; \
    RESET;

// 蓝色
#define DEBUG3(x)                     \
    BLUE;                             \
    cout << #x << " : " << x << endl; \
    RESET;

// 品红
#define DEBUG4(x)                     \
    MAGENTA;                          \
    cout << #x << " : " << x << endl; \
    RESET;

// 青色
#define DEBUG5(x)                     \
    CYAN;                             \
    cout << #x << " : " << x << endl; \
    RESET;

// 黄色
#define DEBUG6(x)                     \
    YELLOW;                           \
    cout << #x << " : " << x << endl; \
    RESET;


using namespace std;


const int N = 1e6 + 10, M = 1e5 + 10, INF = 1e9, mod = 998244353;

int n, m, k;
int a[N];
map<int,vector<int>> pos;

int get(int aim)
{
    //m = aim - k

    vector<PII> v;
    for(auto i : pos[aim])
    {
        v.push_back({i,-1});
    }
    for(auto i : pos[aim - k])
    {
        v.push_back({i,1});
    }
    sort(all(v));
    int ma = 0,mi = 0,pre = 0;
    for(auto [i,j] : v)
    {
        pre += j;
        mi = min(mi,pre);
        ma = max(ma,pre - mi);
    }
    return pos[aim].size() + ma;
}

void solve()
{
    cin >> n >> k;
    vector<int> all;
    FOR(i,1,n)
    {
        cin >> a[i];
        all.push_back(a[i]);
        pos[a[i]].push_back(i);
    }
    sort(all(all));
    all.erase(unique(all(all)),all.end());
    int ans = 0;
    if (k == 0)
    {
        for(auto i : all)
        {
            ans = max(ans,(int)pos[i].size());
        }
    }
    else
    {
        for(auto i : all)
        {
            ans = max(ans,get(i));
        }
    }

    ANS;
}

int main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    auto t = clock();
    int T = 1;
//    cin >> T;
    while (T--)
    {
        solve();
    }
    auto tt = clock();

//    cout << "Time: " << 1000.0 * (tt - t) / CLOCKS_PER_SEC << "ms" << endl;

    return 0;
}