#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


constexpr int INF = 1001001001;

int N, K;
vector<int> A;


namespace brute {
int dp[10010][31];
int run() {
cerr<<"[brute::run]"<<endl;
  int ans = -INF;
  vector<int> stack(N);
  for (int s = 0; s < N; ++s) {
    for (int i = s; i <= s + N; ++i) {
      fill(dp[i], dp[i] + (K + 1), -INF);
    }
    dp[s][0] = 0;
    for (int i = s; i < s + N; ++i) {
      int maxPre = -1;
      int cntPre = 0;
      int stackLen = 0;
      for (int j = i; j < s + N; ++j) {
        if (chmax(maxPre, A[j])) {
          ++cntPre;
        }
        for (; stackLen && stack[stackLen - 1] < A[j]; --stackLen) {}
        stack[stackLen++] = A[j];
        const int score = max(cntPre, stackLen);
        for (int k = 0; k < K; ++k) {
          chmax(dp[j + 1][k + 1], dp[i][k] + score);
        }
      }
    }
    chmax(ans, dp[s + N][K]);
  }
  return ans;
}
}  // brute


int main() {
  for (; ~scanf("%d%d", &N, &K); ) {
    A.resize(2*N);
    for (int i = 0; i < N; ++i) {
      scanf("%d", &A[i]);
    }
    for (int i = N; i < (int)A.size(); ++i) {
      A[i] = A[i - N];
    }
    
    const int ans = brute::run();
    printf("%d\n", ans);
  }
  return 0;
}