#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll long long
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 1e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
ll n,k,a[600060],b[600060],st[600060],top=0,ans=0;
ll f[600060],g[600060],pre[600060],suf[600060];
int main(){
	n=read();
	k=read();
	fr(i,1,n) a[i]=read();
	ll pos=1;
	fr(i,1,n) if(a[i]==n) pos=i;
	fr(i,1,n) b[i]=a[(pos+i-2)%n+1];
	fr(i,1,n) a[i]=b[i];
	fr(i,0,n) f[i]=-inf;
	f[0]=0;
	fr(_,1,k){
		fr(i,0,n){
			g[i]=f[i];
			f[i]=-inf;
		}
		ll maxx=g[0];
		top=0;
		fr(i,1,n){
			pre[i]=suf[i]=maxx+1;
			while(top&&a[st[top]]<a[i]){
				pre[i]=max(pre[i],pre[st[top]]+1);
				top--;
			}
			if(top) suf[i]=max(suf[i],suf[st[top]]+1);
			st[++top]=i;
			f[i]=max(pre[i],suf[i]);
			maxx=max(maxx,g[i]);
		}
	}
	ans=f[n];
	reverse(a+2,a+n+1);
	fr(i,0,n) f[i]=-inf;
	f[0]=0;
	fr(_,1,k){
		fr(i,0,n){
			g[i]=f[i];
			f[i]=-inf;
		}
		ll maxx=g[0];
		top=0;
		fr(i,1,n){
			pre[i]=suf[i]=maxx+1;
			while(top&&a[st[top]]<a[i]){
				pre[i]=max(pre[i],pre[st[top]]+1);
				top--;
			}
			if(top) suf[i]=max(suf[i],suf[st[top]]+1);
			st[++top]=i;
			f[i]=max(pre[i],suf[i]);
			maxx=max(maxx,g[i]);
		}
	}
	write(max(ans,f[n]));
}