#include <bits/stdc++.h>
#define endl "\n"
#define mod 1000000007
#define int long long
using namespace std;
int n,d,arr[300010];
int bigL[300010],bigR[300010],dp[300010];
void stack_trick(){
vector <int> qu;
for(int i=1;i<=n;i++){
while(!qu.empty()&&arr[qu.back()]<=arr[i]){ qu.pop_back();}
if(qu.size()==0) bigL[i]=0;
else bigL[i]=qu.back();
qu.push_back(i);
}
qu.clear();
for(int i=n;i>=1;i--){
while(!qu.empty()&&arr[qu.back()]<=arr[i]){ qu.pop_back();}
if(qu.size()==0) bigR[i]=n+1;
else bigR[i]=qu.back();
qu.push_back(i);
}
qu.clear();
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin>>n>>d;
for(int i=1;i<=n;i++) cin>>arr[i];
stack_trick();
int ans=0;
for(int i=1;i<=n;i++){
dp[i]=1;
int cnt=0;
for(int j=i-1;j>=1;j--){
if(arr[j]>arr[i]){
cnt++;
if(cnt+1>d) break;
}
else cnt=0;
if(arr[i]<=arr[j]) continue;
dp[i]=max(dp[i],dp[j]+1);
}
//cout<<i<<" "<<dp[i]<<endl;
ans=max(ans,dp[i]);
}
cout<<ans<<endl;
}
