// sis puella oier
#include <bits/stdc++.h>
using namespace std;
// #define int long long
typedef long long ll;
ll read(){
    ll xx = 0, f = 1; char ch = getchar();
    for (;!isdigit(ch); ch = getchar())f = (ch == '-' ? -1 : 1);
    for (; isdigit(ch); ch = getchar())xx = (xx << 3) + (xx << 1) + ch - '0';
    return xx * f;
}
const int N = 1000100;
int n, k;
unordered_map <int, int> mp;
vector <int> ve[N];
int cnt = 0, a[N];
int get(int val, int l, int r){
    if (mp[val] == 0)return 0;
    if (l > r)return 0;
    int id = mp[val];
    return upper_bound(ve[id].begin(), ve[id].end(), r) - lower_bound(ve[id].begin(), ve[id].end(), l);
}
int ans = 0;
signed main(){
    n = read(), k = read();
    for (int i = 1; i <= n; ++i){
        a[i] = read();
        if (mp[a[i]] == 0)mp[a[i]] = ++cnt;
        ve[mp[a[i]]].push_back(i);
    }
    for (auto it : mp){
        int val = it.first - k, id = it.second;
        int mx = 0, lst = 0, len = ve[id].size();
        for (int v : ve[id]){
            --mx; mx = max(mx, get(val, lst + 1, v - 1));
            ans = max(ans, mx + len);
            lst = v;
        }
        --mx; mx = max(mx, get(val, lst + 1, n));
        ans = max(ans, mx + len);
    }
    printf("%d\n", ans);
    return 0;
}