#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = a; i <= b; ++i)
#define REP(i, a, b) for(int i = a; i >= b; --i)
#define mp make_pair
#define all(v) v.begin(), v.end()
#define uni(v) v.erase(unique(all(v)), v.end())
const int mod = 1e9 + 7;
inline bool maximize(int &u, int v){
if(v > u){
u = v;
return true;
}
return false;
}
inline bool minimize(int &u, int v){
if(v < u){
u = v;
return true;
}
return false;
}
inline bool maximizell(long long &u, long long v){
if(v > u){
u = v;
return true;
}
return false;
}
inline bool minimizell(long long &u, long long v){
if(v < u){
u = v;
return true;
}
return false;
}
inline int fastPow(int a, int n){
if(n == 0) return 1;
int t = fastPow(a, n >> 1);
t = 1ll * t * t % mod;
if(n & 1) t = 1ll * t * a % mod;
return t;
}
inline void add(int &u, int v){
u += v;
if(u >= mod) u -= mod;
}
inline void sub(int &u, int v){
u -= v;
if(u < 0) u += mod;
}
const int maxN = 2e3 + 5;
int n, a[maxN], k;
long long f[2][maxN][maxN];
const long long infll = 1e18;
void process(){
cin >> n >> k;
FOR(i, 1, n)cin >> a[i];
FOR(i, 0, n)FOR(j, 0, k)FOR(s, 0, 1)f[s][i][j] = -infll;
f[0][0][0] = 0;
FOR(i, 1, n){
FOR(j, 0, k){
f[0][i][j] = max(f[1][i - 1][j], f[0][i - 1][j]);
if(j){
maximizell(f[1][i][j], max(f[0][i - 1][j - 1], max(f[1][i - 1][j], f[1][i - 1][j - 1])) + a[i]);
}
}
}
long long answer = 0;
FOR(i, 1, n)FOR(j, 0, k)maximizell(answer, max(f[0][i][j], f[1][i][j]));
cout << answer;
}
#define NAME ""
int main(){
if(fopen(NAME".inp", "r")){
freopen(NAME".inp", "r", stdin);
freopen(NAME".out", "w", stdout);
}
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin >> t;
while(t--)
process();
cerr << '\n' << "Time elapsed: " << (1.0 * clock() / CLOCKS_PER_SEC) << " s\n" ;
return 0;
}
