#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << " " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << " " << j << " " << #i << " " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<long long,long long>pii;
typedef pair<int,pii>pi2;
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
int arr[405];
int n,k;
int memo[405][405];
int dp(int index, int last){
if(index==n){
return 0;
}
if(memo[index][last]!=-1) return memo[index][last];
int ans=0;
for(int x=index+1;x<=min(n,index+k);x++){
int ptr=last;
int add=0;
if(arr[x]>arr[last]){
add=1;
ptr=x;
}
ans=max(ans,dp(x,ptr)+add);
}
return memo[index][last]=ans;
}
void solve(){
cin >> n >> k;
for(int x=1;x<=n;x++){
cin >> arr[x];
}
int best=0;
memset(memo,-1,sizeof(memo));
for(int x=1;x<=n;x++){
best=max(best,dp(x,x)+1);
}
cout << best;
}
int32_t main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t=1;
//freopen("in.txt","r",stdin);
//cin >> t;
while(t--){
solve();
}
}
