#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={0,1,-1,0,1,1,-1,-1,0};
const ll dx[9]={1,0,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
} 

ll dp[3010][3010][2];//i番目の頂点を見ている、j個の頂点をとる、1なら直前をとっている
int main(){
    ll n,m;cin >> n >> m;
    vl v(n);rep(i,n)cin >> v[i];ll last=v.back();v.pop_back();
    rep(i,3010)rep(j,3010)rep(k,2)dp[i][j][k]=-INF;
    dp[0][0][0]=0;
    rep(i,n-1){
        rep(j,m+1){
            chmax(dp[i+1][j+1][1],dp[i][j][1]+v[i]);
            chmax(dp[i+1][j][0],dp[i][j][1]);
            chmax(dp[i+1][j][0],dp[i][j][0]);
            chmax(dp[i+1][j+1][1],dp[i][j][0]);
        }
    }
    ll ans=max(dp[n-1][m][0],dp[n-1][m][1]);
    //cout << ans << endl;
    rev(all(v));
    rep(i,3010)rep(j,3010)rep(k,2)dp[i][j][k]=-INF;
    dp[0][0][0]=0;
    rep(i,n-1){
        rep(j,m+1){
            chmax(dp[i+1][j+1][1],dp[i][j][1]+v[i]);
            chmax(dp[i+1][j][0],dp[i][j][1]);
            chmax(dp[i+1][j][0],dp[i][j][0]);
            chmax(dp[i+1][j+1][1],dp[i][j][0]);
        }
    }
    chmax(ans,max(dp[n-1][m][0],dp[n-1][m][1]));
    rev(all(v));
    rep(i,3010)rep(j,3010)rep(k,2)dp[i][j][k]=-INF;
    dp[0][1][1]=0;
    rep(i,n-1){
        rep(j,m+1){
            chmax(dp[i+1][j+1][1],dp[i][j][1]+v[i]);
            chmax(dp[i+1][j][0],dp[i][j][1]);
            chmax(dp[i+1][j][0],dp[i][j][0]);
            chmax(dp[i+1][j+1][1],dp[i][j][0]);
        }
    }
    /*rep(i,n){
        rep(j,n){
            cout << dp[i][j][0] <<" " << dp[i][j][1] <<" ";
        }
        cout << endl;
    }*/
    chmax(ans,dp[n-1][m][1]+last);
    cout << ans << endl;
}