#include<iostream>
#include<vector>
#include<set>
#include<algorithm>
using namespace std;
int main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
int n, d, ans = 0; cin >> n >> d;
vector<int> a(n), dp(n, 1);
for (auto& x : a) cin >> x;
if (d == 1) {
vector<int> nxt(n, -1);
set<int> s;
vector<pair<int, int>> sa(n);
for (int i = 0; i < n; ++i) sa[i] = { a[i], i };
sort(sa.begin(), sa.end());
vector<pair<int, vector<int>>> arr;
for (int i = 0; i < n; ++i)
if ((i == 0) || (sa[i - 1].first < sa[i].first))
arr.push_back({ sa[i].first, {sa[i].second} });
else arr.back().second.push_back(sa[i].second);
int m = arr.size();
for (int i = m - 1; i >= 0; --i) {
for (auto x : arr[i].second) {
auto it = s.lower_bound(x + 1);
if (it != s.end()) nxt[x] = *it;
}
for (auto x : arr[i].second) s.insert(x);
}
for (int i = n - 1; i >= 0; --i)
dp[i] = ((nxt[i] == -1) ? 0 : dp[nxt[i]]) + 1;
int mx = 0;
for (auto x : dp) mx = max(x, mx);
cout << mx << endl;
}
else {
for (int i = n - 1; i >= 0; --i) {
int ld = i + d;
for (int j = i + 1; j <= min(n - 1, ld); ++j) {
if (a[i] >= a[j]) ld = j + d;
else dp[i] = max(dp[i], dp[j] + 1);
}
ans = max(ans, dp[i]);
}
cout << ans;
}
}
