#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) (a.begin()),(a.end())
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
typedef __int128_t lll;
typedef pair<lll,lll> plll;
typedef vector<lll> vlll;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;
int n, m, w[3000], DP[2][3001][2];

main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n >> m;
  FOR(i, 0, n) cin >> w[i];
  int ans = -iinf;
  FOR(i, 0, 2)FOR(j, 0, m+1)FOR(k, 0, 2) DP[i][j][k] = -iinf;
  DP[0][0][0] = 0;
  FOR(i, 2, n+1){
    FOR(j, 1, min(i, m)+1){
      DP[1][j][0] = max(DP[0][j][0], DP[0][j][1]);
      DP[1][j][1] = max(DP[0][j-1][0], DP[0][j-1][1] + w[i-2]);
    }
    memmove(DP[0], DP[1], sizeof(DP[1]));
  }
  FOR(i, 0, 2) maxs(ans, DP[0][m][i]);

  FOR(i, 0, 2)FOR(j, 0, m+1)FOR(k, 0, 2) DP[i][j][k] = -iinf;
  DP[0][1][1] = 0;
  FOR(i, 2, n+1){
    FOR(j, 1, min(i, m)+1){
      DP[1][j][0] = max(DP[0][j][0], DP[0][j][1]);
      DP[1][j][1] = max(DP[0][j-1][0], DP[0][j-1][1] + w[i-2]);
    }
    memmove(DP[0], DP[1], sizeof(DP[1]));
  }
  DP[0][m][1] += w[n-1];
  FOR(i, 0, 2) maxs(ans, DP[0][m][i]);
  cout << ans << endl;
  return 0;
}