#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define i64 long long
#define endl '\n'
#define lb(x) ((x) & (-x))
using namespace std;
const i64 mod = 1e9;
const int maxn = 3e7 + 10;
struct node
{
    int l,r,cnt;
}tr[maxn];
int top;
int clone(int i)
{
    top++;
    tr[top] = tr[i];
    return top;
}
int build(int l,int r)
{
    int i = ++top;
    if(l == r) return top;
    int mid = l + r >> 1;
    tr[i].l = build(l,mid);
    tr[i].r = build(mid+1,r);
    return i;
}
int add(int i,int l,int r,int x)
{
    i = clone(i);
    if(l == r)
    {
        tr[i].cnt++;
        return i;
    }
    int mid = l + r >> 1;
    if(x <= mid) tr[i].l = add(tr[i].l,l,mid,x);
    else tr[i].r = add(tr[i].r,mid+1,r,x);
    return i;
}
int query(int i,int l,int r,int x)
{
    if(l == r) return tr[i].cnt;
    int mid = l + r >> 1;
    if(x <= mid) return query(tr[i].l,l,mid,x);
    else return query(tr[i].r,mid+1,r,x);
}
signed main()
{
    IOS;
    int n,k; cin >> n >> k;
    vector<int> a(n+1);
    vector<int> s;
    for(int i = 1; i <= n; ++i)
    {
        cin >> a[i];
        s.push_back(a[i]);
    }
    sort(s.begin(),s.end());
    int len = unique(s.begin(),s.end()) - s.begin() - 1;

    s.push_back(mod);

    vector<int> root(n+1);
    root[0] = build(0,len);
    vector<vector<int>> v(len+1);
    for(int i = 1; i <= n; ++i)
    {
        int p = lower_bound(s.begin(),s.begin()+len + 1,a[i]) - s.begin();
        root[i] = add(root[i-1],0,len,p);
        v[p].push_back(i);
    }
    int mx = 0;
    auto get = [&](int l,int r,int x) -> int
    {
        int res = 0;
        int p = lower_bound(s.begin(),s.begin() + len + 1,s[x] + k) - s.begin();
        if(s[p] == s[x] + k) res = query(root[n],0,len,p) - query(root[r],0,len,p) + query(root[l-1],0,len,p);
        res += query(root[r],0,len,x) - query(root[l-1],0,len,x);
        return res;
    };
    for(int i = 0; i <= len; ++i)
    {
        int p = lower_bound(s.begin(),s.begin()+len + 1,s[i] + k) - s.begin();
        int now = 0,l = v[i][0];
        if(s[p] == s[i] + k) now = query(root[n],0,len,p);
        int c = v[i].size();
        mx = max(mx,c);
        for(int &x : v[i])
        {
            int res = get(l,x,i);
            mx = max(mx,res);
            if(res < now) l = x;
        }
    }
    cout << mx << endl;
    return 0;
}