#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#include <cassert>
#include <cstring>
#include <iostream>
#include <algorithm>
#define pii pair <int , int>
#define pll pair <LL , LL>
#define mp make_pair
#define fs first
#define sc second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;

//const int Mxdt=100000;
//static char buf[Mxdt],*p1=buf,*p2=buf;
//#define getchar() p1==p2&&(p2=(p1=buf)+fread(buf,1,Mxdt,stdin),p1==p2)?EOF:*p1++;

template <typename T>
void read(T &x) {
	T f=1;x=0;char s=getchar();
	while(s<'0'||s>'9') {if(s=='-') f=-1;s=getchar();}
	while(s>='0'&&s<='9') {x=(x<<3)+(x<<1)+(s^'0');s=getchar();}
	x *= f;
}

template <typename T>
void write(T x , char s='\n') {
	if(!x) {putchar('0');putchar(s);return;}
	if(x<0) {putchar('-');x=-x;}
	T t = 0 , tmp[25] = {};
	while(x) tmp[t ++] = x % 10 , x /= 10;
	while(t -- > 0) putchar(tmp[t] + '0');
	putchar(s);
}

const int MAXN = 6e5 + 5;

int f[2][MAXN] , g[2][MAXN] , h[MAXN] , a[MAXN << 1] , b[MAXN];
int n , k , las[MAXN] , nxt[MAXN] , sta[MAXN] , top;

/*
f pre
g suf
*/

int solve() {
	sta[0] = n + 1;top = 0;
	for (int i = n; i >= 1; --i) {
		while(top && b[sta[top]] < b[i]) top --;
		sta[++top] = i;
		nxt[i] = sta[top - 1];
	}
	
	sta[0] = 0;
	top = 0;
	for (int i = 1; i <= n; ++i) {
		while(top && b[sta[top]] < b[i]) top --;
		sta[++top] = i;
		las[i] = sta[top - 1];
	}
	
	int ans = 0;
	for (int j = 1; j <= k; ++j) {
		g[j & 1][0] = -1e9;
		for (int i = 1; i <= n; ++i) {
			g[j & 1][i] = max(g[j & 1][las[i]] + 1 , 1 + h[i - 1]);
			f[j & 1][i] = max(f[j & 1][i] , max(g[(j - 1) & 1][i - 1] , f[(j - 1) & 1][i - 1]));
			f[j & 1][nxt[i]] = max(f[j & 1][nxt[i]] , f[j & 1][i] + 1);
			h[i] = max(h[i - 1] , max(g[(j - 1) & 1][i] , f[(j - 1) & 1][i]));
			ans = max(ans , max(f[j & 1][i] , g[j & 1][i]));
		}
		memset(f[(j - 1) & 1] , 0 , sizeof f[(j - 1) & 1]);
		memset(g[(j - 1) & 1] , 0 , sizeof g[(j - 1) & 1]);
		memset(h , 0 , sizeof h);
	} 
	memset(f[k & 1] , 0 , sizeof f[k & 1]);
	memset(g[k & 1] , 0 , sizeof g[k & 1]);
	memset(h , 0 , sizeof h);
	return ans;
}

int main() {
	read(n),read(k);
	for (int i = 1; i <= n; ++i) read(a[i]) , a[i + n] = a[i];
	int p = 1;
	for (int i = 1; i <= n; ++i) if(a[i] == n) {
		p = i;
	}
	
	for (int i = 1; i <= n; ++i) b[i] = a[p + i - 1];
	
	int ans = solve();
	
	for (int i = 1; i <= n; ++i) b[i] = a[p + i];
	
	ans = max(ans , solve());
	write(ans);
	return 0;
}