#include <iostream>
#include <vector>
#define repeat(i,n) for (int i = 0; (i) < (n); ++(i))
template <class T> bool setmax(T & l, T const & r) { if (not (l < r)) return false; l = r; return true; }
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
const int INF = 1e9;
int main() {
    int n, m; cin >> n >> m;
    vector<int> w(n); repeat (i,n) cin >> w[i];
    int ans = - INF;
    repeat (p,2) {
        vvvi dp(n+1, vvi(m+1, vi(2, - INF)));
        dp[0][p][p] = 0;
        repeat (i,n-1) repeat (j,m+1) {
            ;;;;;;;;;;; dp[i+1][j][false] = max(dp[i][j  ][false], dp[i][j  ][true]);
            if (j >= 1) dp[i+1][j][ true] = max(dp[i][j-1][false], dp[i][j-1][true] + w[i]);
        }
        repeat (j,m+1) {
            dp[n][j][false] = max(dp[n-1][j][false], dp[n-1][j][true]);
            dp[n][j][ true] = max(dp[n-1][j][false], dp[n-1][j][true] + (p ? w[n-1] : 0));
        }
        setmax(ans, dp[n][m][p]);
    }
    cout << ans << endl;
    return 0;
}