#include <iostream>
using namespace std;

const int kNEG_INF = -(1 << 28);
const int kMAX_N = 3010;
const int kMAX_M = 3010;

int n, m;
int w[kMAX_N];

int dp[2][kMAX_M][2][2];  // dp[i+1][v_num][before_used][first_used]

void Initialize(int arr[][2][2]) {
    for (int i = 0; i <= m; i++) for (int j = 0; j <= 1; j++)
        for (int k = 0; k <= 1; k++) arr[i][j][k] = kNEG_INF;
}

void Solve() {
    // dp
    Initialize(dp[0]);
    dp[0][0][0][0] = 0;
    for (int vi = 0; vi < n; vi++) {
        Initialize(dp[(vi + 1) % 2]);
        for (int v_num = 0; v_num <= m; v_num++) {
            for (int before_used = 0; before_used <= 1; before_used++) {
                for (int first_used = 0; first_used <= 1; first_used++) {
                    // printf("[debug] vi %d v_num %d before_used %d first_used %d val %d\n", vi, v_num, before_used, first_used, dp[vi % 2][v_num][before_used][first_used]);
                    if (dp[vi % 2][v_num][before_used][first_used] <= kNEG_INF) continue;
                    // 使わない
                    dp[(vi + 1) % 2][v_num][false][first_used] = max(dp[(vi + 1) % 2][v_num][false][first_used],
                                                                     dp[vi % 2][v_num][before_used][first_used]);
                    if (v_num + 1 > m) continue;

                    // 使う
                    if (before_used) { // 辺のコストが追加
                        dp[(vi + 1) % 2][v_num + 1][true][first_used | (vi == 0)] = max(dp[(vi + 1) % 2][v_num + 1][true][first_used | (vi == 0)],
                                                                                      dp[vi % 2][v_num][before_used][first_used] + w[(vi - 1 + n) % n]);
                    } else {    // 辺のコストは増えない
                        dp[(vi + 1) % 2][v_num + 1][true][first_used | (vi == 0)] = max(dp[(vi + 1) % 2][v_num + 1][true][first_used | (vi == 0)],
                                                                                        dp[vi % 2][v_num][before_used][first_used]);
                    }
                }
            }
        }
    }
    int ans = kNEG_INF;
    for (int before_used = 0; before_used <= 1; before_used++) {
        for (int first_used = 0; first_used <= 1; first_used++) {
            if (before_used && first_used) {
                ans = max(ans, dp[n % 2][m][before_used][first_used] + w[n - 1]);
            } else {
                ans = max(ans, dp[n % 2][m][before_used][first_used]);
            }
        }
    }
    cout << ans << endl;
}

int main() {
    cin >> n >> m;

    for (int i = 0; i < n; i++) {
        cin >> w[i];
    }

    Solve();

    return 0;
}