#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define SZ(x) ((int)(x).size())
#define all(x) x.begin(), x.end()
#define debug(x) cout << #x << ": " << x << " "
#define nl cout << "\n"
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MAXN = 300+100;
const int MAXK = 300+100;
int N, K, a[MAXN];
ll pr[MAXN], dp[MAXN][MAXK];
void solve(){
cin >> N >> K;
rep(i, 1, N + 1){
cin >> a[i];
pr[i] = pr[i - 1] + a[i];
}
rep(k, 1, K + 1){
rep(i, 1, N + 1){
dp[i][k] = dp[i - 1][k];
rep(j, 1, i){
dp[i][k] = max(dp[i][k], dp[j - 1][k - 1] + pr[i] - pr[j - 1]);
}
}
}
cout << dp[N][K];
}
int main(){
ios_base::sync_with_stdio(false), cin.tie(nullptr);
solve();
return 0;
}
