#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, x; cin >> n >> x;
vector<int> a(n);
for (int i = 0; i < n; ++i) cin >> a[i];
vector<int> d(n + 1, INT32_MAX);
d[0] = INT32_MIN;
vector<pair<int, int>> at(n + 1, {0, INT32_MIN});
for (int i = 0; i < n; ++i) {
int l = upper_bound(d.begin(), d.end(), a[i] - x) - d.begin();
if (d[l - 1] < a[i] - x) {
d[l] = a[i] - x;
at[i + 1] = {l, a[i] - x};
}
}
int ans = at[n].first;
d.assign(n + 1, INT32_MAX);
d[0] = INT32_MIN;
for (int i = n - 1; i >= 0; --i) {
int l = upper_bound(d.begin(), d.end(), -a[i]) - d.begin();
if (d[l - 1] < -a[i]) {
d[l] = -a[i];
}
l = lower_bound(d.begin(), d.end(), -at[i].second) - d.begin() - 1;
ans = max(ans, at[i].first + l);
}
cout << ans << '\n';
return 0;
}
