///Never gonna give you up.
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
typedef long long int lli;
typedef unsigned long long ull;
using namespace std;
using namespace __gnu_pbds;
template<class x>
using ordered_set = tree<x, null_type,less<x>, rb_tree_tag,tree_order_statistics_node_update>;
const ll mod=(ll)1e9+7;
const ll mod1=998244353;
///the defines :)
#define endl '\n'
#define vi vector<int>
#define vll vector<ll>
#define ent(arr) for(int i=0;i<arr.size();i++)cin>>arr[i];
#define all(arr) arr.begin(),arr.end()
#define allr(arr) arr.rbegin(),arr.rend()
#define sz size()
#define int long long
int n,d;
vi arr;
int dp[402][402][402];
int ans(int idx,int prv,int prv1)
{
if(idx==n)
return 0;
if(dp[idx][prv][prv1]!=-1)
return dp[idx][prv][prv1];
int e=0;
if(arr[idx]<arr[prv])
e=max(ans(idx+1,prv,idx),e);
if(arr[idx]>=arr[prv])
e=max(ans(idx+1,idx,idx)+1-(arr[idx]==arr[prv]),e);
if(idx-prv1<d||prv==n||prv==n)
e=max(ans(idx+1,prv,prv1),e);
return dp[idx][prv][prv1]=e;
}
void preprocess() {}
void solve()
{
cin>>n>>d;
arr.resize(n);
ent(arr);
if(d==n)
{
vi ans;
for(int i=0; i<n; i++)
{
int x=lower_bound(all(ans),arr[i])-ans.begin();
if(x==ans.sz)
ans.push_back(arr[i]);
else
ans[x]=arr[i];
}
}
else
{
memset(dp,-1,sizeof dp);
arr.push_back(-1e9);
cout<<ans(0,n,n)<<endl;
}
}
signed main()
{
// freopen("div7.in","r",stdin);
//freopen("div7.out","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
preprocess();
//bla();
int t=1;
//cin>>t;
while(t--)
solve();
}
