#include<bits/stdc++.h>
using namespace std;
const int MAXN=6e5+5,inf=1e9;
int n,k,a[MAXN],ans=0,f[MAXN],g[MAXN];
int w(int l,int r) {
	int z=0,s=0,t=0;
	for(int i=l;i<=r;++i) if(a[i]>z) z=a[i],++s;
	z=0;
	for(int i=r;i>=l;--i) if(a[i]>z) z=a[i],++t;
	return max(s,t);
}
void DP() {
	memset(f,-0x3f,sizeof(f)),f[0]=0;
	for(int x=1;x<=k;++x) {
		memset(g,-0x3f,sizeof(g));
		for(int i=1;i<=n;++i) {
			for(int j=0;j<i;++j) {
				g[i]=max(g[i],f[j]+w(j+1,i));
			}
		}
		memcpy(f,g,sizeof(f));
	}
	ans=max(ans,*max_element(f+1,f+n+1));
}
signed main() {
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;++i) scanf("%d",&a[i]);
	int t=find(a+1,a+n+1,n)-a;
	assert(a[t]==n);
	rotate(a+1,a+t,a+n+1),DP();
	rotate(a+1,a+2,a+n+1),DP();
	printf("%d\n",ans);
	return 0;
}