#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
/*
Phu Trong from Nguyen Tat Thanh High School for gifted student
*/
template <class X, class Y>
bool minimize(X &x, const Y &y){
X eps = 1e-9;
if (x > y + eps) {x = y; return 1;}
return 0;
}
template <class X, class Y>
bool maximize(X &x, const Y &y){
X eps = 1e-9;
if (x + eps < y) {x = y; return 1;}
return 0;
}
int nArr, maxDist;
#define MAX 300005
int A[MAX];
namespace SUBTASK_3{
bool check(void){
return (nArr <= 7000);
}
int dp[7777];
void main(void){
for (int i = 1; i <= nArr; ++i) dp[i] = 1;
int ans = 0;
for (int i = 1; i <= nArr; ++i){
int cnt = 0, max_value = 0;
bool ok = 1;
for (int j = i - 1; j >= 1; --j){
maximize(max_value, A[j]);
if(A[j] >= A[i]) ++cnt;
else cnt = 0;
if(cnt >= maxDist) ok = 0;
if(i - j <= maxDist){
if(A[i] > A[j]) maximize(dp[i], dp[j] + 1);
}
else if(ok) {
if(A[i] > A[j]) maximize(dp[i], dp[j] + 1);
}
}
maximize(ans, dp[i]);
}
cout << ans;
}
}
namespace SUBTASK_6{
vector<int> comp;
int findID(int x){
return lower_bound(comp.begin(), comp.end(), x) - comp.begin() + 1;
}
struct SegmentTree{
vector<int> st;
int n;
SegmentTree(int _n = 0){
this -> n = _n;
st.resize((n << 1) + 5, 0);
}
void upd(int p, int val){
for (st[p += n] = val; p > 0; p >>= 1){
st[p >> 1] = max(st[p], st[p ^ 1]);
}
}
int query(int l, int r){
int res = 0;
for (l += n, r += n + 1; l < r; l >>= 1, r >>= 1){
if (l & 1) maximize(res, st[l++]);
if (r & 1) maximize(res, st[--r]);
}
return res;
}
};
vector<int> ID[MAX];
int mn[MAX], pa[MAX];
int find(int u){
return u == pa[u] ? u : pa[u] = find(pa[u]);
}
bool joint(int u, int v){
u = find(u), v = find(v);
if (u == v) return false;
pa[v] = u;
mn[u] = min(mn[u], mn[v]);
return true;
}
void main(void){
for (int i = 1; i <= nArr; ++i){
comp.push_back(A[i]);
}
sort(comp.begin(), comp.end());
comp.resize(unique(comp.begin(), comp.end()) - comp.begin());
for (int i = 1; i <= nArr; ++i) pa[i] = mn[i] = i;
for (int i = 1; i <= nArr; ++i){
A[i] = findID(A[i]);
ID[A[i]].emplace_back(i);
}
set<int> mySet;
SegmentTree myit(nArr);
for (int i = 1; i <= nArr; ++i){
if ((int)ID[i].size() == 0) continue;
reverse(ID[i].begin(), ID[i].end());
for (int &j : ID[i]){
auto lw = mySet.lower_bound(j);
if (lw != mySet.begin()){
--lw;
if(j - *lw <= maxDist)
joint(j, *lw);
}
auto hg = mySet.lower_bound(j);
if(hg != mySet.end()){
if (*hg - j <= maxDist)
joint(j, *hg);
}
int cur_dp = 1;
int good = mn[find(j)];
maximize(cur_dp, 1LL * myit.query(good, j - 1) + 1);
myit.upd(j, cur_dp);
mySet.insert(j);
}
}
cout << myit.query(1, nArr);
}
}
void process(void){
cin >> nArr >> maxDist;
for (int i = 1; i <= nArr; ++i) cin >> A[i];
if(SUBTASK_3 :: check()){
SUBTASK_3 :: main();
return;
}
//SUBTASK_6 :: main();
}
signed main(){
#define name "Whisper"
cin.tie(nullptr) -> sync_with_stdio(false);
//freopen(name".inp", "r", stdin);
//freopen(name".out", "w", stdout);
process();
return (0 ^ 0);
}
