#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int MAXN=6e5+5;
int s[MAXN],top;
int n,k,ans,a[MAXN],b[MAXN];
int pre[MAXN],nxt[MAXN],f[MAXN],g[MAXN];
void solve() {
	s[top=0]=0;
	for(int i=1;i<=n;++i) {
		while(top&&b[s[top]]<b[i]) --top;
		pre[i]=s[top],s[++top]=i;
	}
	s[top=0]=n+1;
	for(int i=n;i>=1;--i) {
		while(top&&b[s[top]]<b[i]) --top;
		nxt[i]=s[top],s[++top]=i;
	}
	memset(f,0,sizeof(int)*(n+1));
	for(int j=1;j<=k;++j) {
		int mx=0;
		memset(g,0,sizeof(int)*(n+1));
		for(int i=1;i<=n;++i) {
			g[i]=max(g[i],f[i-1]+1);
			g[nxt[i]]=max(g[nxt[i]],g[i]+1);
		}
		for(int i=1;i<=n;++i) {
			int rec=f[i];
			f[i]=max(f[pre[i]],mx)+1;
			mx=max(mx,rec);
		}
		for(int i=1;i<=n;++i) g[i]=max(g[i-1],g[i]),f[i]=max(f[i],g[i]);
	}
	ans=max(ans,f[n]);
}
signed main() {
	#ifndef ONLINE_JUDGE
	freopen(".in","r",stdin);
	freopen(".out","w",stdout);
	#endif
	ios::sync_with_stdio(0),cin.tie(0);
	cin>>n>>k;
	int jqh=0;
	for(int i=1;i<=n;++i) {
		cin>>a[i];
		if(a[i]==n) jqh=i;
	}
	for(int i=jqh%n+1,j=1;j<=n;i=i%n+1,++j) b[j]=a[i];
	solve();
	reverse(b+1,b+1+n);
	solve();
	printf("%d",ans);
	return 0;
}