#include<bits/stdc++.h>
#define pb push_back
#define P make_pair
#define fi first
#define se second
#define bit(s,x) (((s)>>(x))&1)
#define pnp(s) __builtin_popcountll(s)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
typedef long long ll; 
typedef unsigned long long ull;
typedef pair<int,int> pii;
inline ll read(){
	ll x=0,f=1,c=getchar();
	while(c<'0'||c>'9')f=(c=='-'?-1:1),c=getchar();
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x*f;
}
const int N=6e5+3;
int n,K,p[N],a[N];
int F[2][N],*f=F[0],*g=F[1];
int st[N],b[N],c[N],d[N];
inline int solve(){
	memset(F,-0x7f,sizeof F);
	rep(_,1,K){
		g[0]=0;
		int tp=0,mx1=0;
		f[0]=0;
		d[0]=INT_MIN;
		rep(i,1,n){
			int mx=f[i-1],mx2=f[i-1];
			for(;tp&&a[st[tp]]<a[i];--tp){
				mx=max(mx,b[tp]);
				mx2=max(mx2,c[tp]+tp);
			}
			st[++tp]=i,b[tp]=mx+1,c[tp]=mx2-tp;
			d[tp]=max(d[tp-1],c[tp]);
			mx1=max(mx1,mx+1);
			g[i]=max(mx1,d[tp]+tp+1);
		}
		swap(f,g);
	}
	int ans=0;
	rep(i,0,n)ans=max(ans,f[i]);
	return ans;
}
int main() {
    //freopen("data.in", "r", stdin);
    // freopen("myans.out","w",stdout);
	n=read(),K=read();rep(i,1,n)p[i]=read();
	int ans=0;
	rep(i,1,n)if(p[i]==n){
		rep(j,1,n)a[j]=p[i+j-1>n?i+j-1-n:i+j-1];
		ans=max(ans,solve());
		rep(j,1,n)a[j]=p[i+j>n?i+j-n:i+j];
		ans=max(ans,solve());
		printf("%d",ans);
		return 0;
	}
    return 0;
}