#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define mk make_pair
#define pii pair<int,int>
#define f first
#define s second
struct Segment{
vector<int>st;
Segment(int _n): st(4*(_n+2)){}
void update(int id,int l,int r,int p,int val){
if(l==r){
st[id]=val;
return;
}
int mid=l+r>>1;
if(p<=mid)update(id*2,l,mid,p,val);
else update(id*2+1,mid+1,r,p,val);
st[id]=max(st[id*2],st[id*2+1]);
}
int get(int id,int l,int r,int u,int v){
if(r<u || l>v) return 0;
if(u<=l && r<=v) return st[id];
int mid=l+r>>1;
return max(get(id*2,l,mid,u,v),get(id*2+1,mid+1,r,u,v));
}
};
const int N=3e5+5;
int M[N];
vector<int>can;
int n;
void compress(){
sort(all(can));
can.erase(unique(all(can)),can.end());
for(int i=1;i<=n;++i){
M[i]=lower_bound(all(can),M[i])-can.begin()+1;
}
}
pii dp[N];
int d;
void solve(){
cin>>n>>d;
for(int i=1;i<=n;++i){
cin>>M[i];
}
for(int i=1;i<=n;++i){
for(int j=i-1;j>=max(1,i-d);--j){
if(dp[j].s <M[i]){
if(dp[i].f<=dp[j].f+1){
dp[i].f=dp[j].f+1;
dp[i].s=M[i];
}
}
else {
if(dp[i].f<=dp[j].f){
dp[i].f=dp[j].f;
dp[i].s=dp[j].s;
}
}
}
}
cout<<dp[n].f;
}
signed main(){
//freopen("XORanges.inp","r",stdin);
//freopen("XORanges.out","w",stdout);
ios_base::sync_with_stdio(0);cin.tie(0);
solve();
}
