#include <bits/stdc++.h>


using namespace std;


#define ll long long
#define flt double
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()


int n, k;
vector<int> a;


ll solve_slow(vector<int> b){
    if(k >= n){
        return n;
    }
    if(k == 1){

    }
    vector<vector<int>> d(n + 1, vector<int>(n + 1));
    for(int l = 0; l <= n; l += 1){
        int mx = -1;
        int cnt = 0;
        for(int r = l + 1; r <= n; r += 1){
            if(b[r - 1] > mx){
                mx = b[r - 1];
                cnt += 1;
            }
            d[l][r] = max(d[l][r], cnt);
        }
    }
    for(int r = n; r >= 0; r -= 1){
        int mx = -1;
        int cnt = 0;
        for(int l = r - 1; l >= 0; l -= 1){
            if(b[l] > mx){
                mx = b[l];
                cnt += 1;
            }
            d[l][r] = max(d[l][r], cnt);
        }
    }
    vector<vector<int>> dp(n + 1, vector<int>(k + 1));
    for(int i = 1; i <= n; i += 1){
        for(int j = 0; j < i; j += 1){
            for(int c = 0; c < k; c += 1){
                dp[i][c + 1] = max(dp[i][c + 1], dp[j][c] + d[j][i]);
            }
        }
    }
    return dp[n][k];
}


ll solve_slow(){
    if(n == 1){
        return 1;
    }
    auto b = a;
    int mx_i = 0;
    for(int i = 1; i < n; i += 1){
        if(b[i] > b[mx_i]){
            mx_i = i;
        }
    }
    rotate(b.begin(), b.begin() + mx_i, b.end());
    ll rs = solve_slow(b);
    rotate(b.begin(), b.begin() + 1, b.end());
    rs = max(rs, solve_slow(b));
    for(int itr = 0; itr < n; itr += 1){
        rotate(b.begin(), b.begin() + 1, b.end());
        rs = max(rs, solve_slow(b));
    }
    return rs;
}


int32_t main(){
    if(1){
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);
    }
    cin >> n >> k;
    a.resize(n);
    for(int i = 0; i < n; i += 1){
        cin >> a[i];
        --a[i];
    }
    ll rs = solve_slow();
    cout << rs << "\n";
    return 0;
}