#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using pi=pair<int,int>;
#define fi first
#define se second
const int N=6e5+5;
int n,m,ans,a[N],a0[N],st[N],f[N],g[N],g1[N],g2[N];
template<class T>void gmax(T&x,T y){x=(x>y?x:y);}
void slv() {
    memset(f,-0x3f,sizeof(f)),f[0]=0;
    for(int o=1;o<=m;o++) {
        memcpy(g,f,sizeof(g)),memset(f,-0x3f,sizeof(f));
        int mx=g[0],top=0,Mx=-1e9;
        for(int i=1;i<=n;i++) {
            g1[a[i]]=g[i-1]+1,g2[a[i]]=mx+1;
            while(top&&a[st[top]]<a[i]) {
                gmax(g1[a[i]],g1[a[st[top]]]+1);
                top--;
            }
            if(top)gmax(g2[a[i]],g2[a[st[top]]]+1);
            gmax(Mx,max(g1[a[i]],g2[a[i]]));
            f[i]=Mx,mx=max(mx,g[i]),st[++top]=i;
        }
    }ans=max(ans,f[n]);
}
int main() {
    #ifndef ONLINE_JUDGE
        freopen(".in","r",stdin);
        freopen(".out","w",stdout);
    #endif
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    cin>>n>>m;int p0=0;
    for(int i=1;i<=n;i++)cin>>a0[i],p0=(a0[i]==n?i:p0);
    for(int i=1;i<=n;i++)a[i]=a0[(i-2+p0)%n+1];
    slv(),reverse(a+1,a+n+1),slv(),cout<<ans<<'\n';
    return 0;
}