#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ordered_set <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ordered_multiset <int, null_type, less_equal <int>, rb_tree_tag, tree_order_statistics_node_update>
#define int long long
#define double long double
#define pii pair <int, int>
#define tiii tuple <int, int, int>
#define tiiii tuple <int, int, int, int>
#define emb emplace_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define iShowSpeed cin.tie(NULL)->sync_with_stdio(false)
#define matrix vector <vector <int>>
#define mat(n, m) vector <vector <int>> (n, vector <int> (m));
const int mod = 1e9 + 7;
const int inf = 1e18;
const matrix II = {{1, 0}, {0, 1}};
const int N = 2e5 + 5;
void solve(){
int n, k; cin >> n >> k;
vector <int> a(n + 1); for (int i = 1; i <= n; i++) cin >> a[i];
vector <int> suf(n + 1), lis;
for (int i = n; i >= 1; i--) {
if (lis.empty() || lower_bound(all(lis), -a[i]) == lis.end()) lis.emb(-a[i]), suf[i] = lis.size();
else {
int idx = lower_bound(all(lis), -a[i]) - lis.begin();
lis[idx] = -a[i], suf[i] = idx + 1;
}
}
int ans = lis.size();
lis.clear();
for (int i = 1; i <= n; i++) {
ans = max(ans, lower_bound(all(lis), a[i] + k) - lis.begin() + suf[i]);
if (lis.empty() || lower_bound(all(lis), a[i]) == lis.end()) lis.emb(a[i]);
else lis[lower_bound(all(lis), a[i]) - lis.begin()] = a[i];
}
cout << ans;
}
int32_t main(){
iShowSpeed;
// int q; cin >> q; while (q--)
solve();
}
