#include <bits/stdc++.h>
using namespace std;
const int N = 5005;

int n, k, A[N], pos, Pos, a[N], val[N][N], dp[2][N], opt, ans = -1e9;

void work() {
	for (int l = 1; l <= n; ++l)
		for (int r = l, mx = -1, now = 0; r <= n; ++r) {
			if (a[r] > mx) mx = a[r], now++;
			val[l][r] = now;
		}
	for (int r = n; r >= 1; --r)
		for (int l = r, mx = -1, now = 0; l >= 1; --l) {
			if (a[l] > mx) mx = a[l], now++;
			val[l][r] = max(val[l][r], now);
		}
	for (int i = 0; i <= n; ++i) dp[0][i] = dp[1][i] = -1e9;
	dp[opt][0] = 0;
	for (int o = 1; o <= k; ++o) {
		opt ^= 1;
		for (int i = 1; i <= n; ++i) {
			dp[opt][i] = -1e9;
			for (int j = o; j <= i; ++j) dp[opt][i] = max(dp[opt][i], dp[opt ^ 1][j - 1] + val[j][i]);
		}
	}
	for (int i = k; i <= n; ++i) ans = max(ans, dp[opt][i]);
}

int main() {
	scanf("%d%d", &n, &k);
	for (int i = 1; i <= n; ++i) {
		scanf("%d", &A[i]);
		if (A[i] == n) pos = i;
		if (A[i] == 1) Pos = 1;
	}
	for (int i = pos, j = 1; j <= n; ++i, ++j) {
		if (i > n) i -= n;
		a[j] = A[i];
	}
	work();
	for (int i = 1; i < n; ++i) a[i] = a[i + 1]; a[n] = n;
	reverse(a + 1, a + 1 + n);
	
	return printf("%d\n", ans), 0;
}
/*
18 1
1 3 5 7 9 11 13 15 17 18 16 14 12 10 8 6 4 2
*/