#include <bits/stdc++.h>
#define ll long long
#define pii pair <int, int>
#define fi first
#define se second
#define pb push_back

using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int N = 6e5+5, K = 35;  
int n, k, f[K][N], a[N], ans, stk[N], ed, mx[N], c[N]; 

void sol () {
	memset(f, -0x3f, sizeof f); 
	f[0][0] = 0; 
	for (int i = 1;i <= k;i++) {
		ed = 0; 
		for (int j = 1;j <= n;j++) {
			mx[j] = a[j]; c[j] = 1; 
			for (int z = j-1;z >= 1 && mx[z] < a[j];z--) mx[z] = a[j], c[z]++; 
			while (ed && a[stk[ed]] < a[j]) ed--; 
			stk[++ed] = j; 
			for (int z = 1;z <= j;z++) f[i][j] = max(f[i][j], f[i-1][z-1]+c[z]); 
//			cout << j << " " << ed << endl; 
			for (int z = ed;z >= 1;z--) {
				for (int p = stk[z];p > stk[z-1];p--) f[i][j] = max(f[i][j], f[i-1][p-1]+ed-z+1); 
			}
		}
	}
	for (int i = 1;i <= n;i++) ans = max(ans, f[k][i]); 
}

signed main () {
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	cin >> n >> k; 
	for (int i = 1;i <= n;i++) cin >> a[i]; 
	for (int i = 1;i <= n;i++) 
		if (a[i] == n) {
			rotate(a+1, a+i, a+1+n); break; 
		}
	sol(); 
	reverse(a+1, a+1+n); rotate(a+1, a+n, a+1+n); 
	sol();
	cout << ans;  
	return 0;
}