#include <bits/stdc++.h>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define int long long
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;
int32_t main() {
int n, K, neg = 0;
cin >> n >> K;
vector<int> v(n+1);
vector<ll> pref(n+1);
for(int i=1; i<=n; i++) {
cin >> v[i];
neg += (v[i] < 0);
pref[i] = pref[i-1] + v[i];
}
if(neg == 0) {
cout << pref[n] << '\n';
return 0;
}
if(neg == 1) {
ll N = 0;
for(int &x : v) if(x < 0) N = x;
cout << pref[n] - (K < n ? N : 0) << '\n';
return 0;
}
if(K == 1) {
ll ans = 0, sum = 0, mn = 0;
for(int i=1; i<=n; i++) {
sum += v[i];
ans = max(ans, sum - mn);
mn = min(mn, sum);
}
cout << ans << '\n';
return 0;
}
ll dp[n+1][K+1];
memset(dp, 0, sizeof(dp));
for(int i=1; i<=n; i++) {
for(int j=0; j<=K; j++) {
dp[i][j] = dp[i-1][j];
if(j) {
for(int k=1; k<i; k++) {
dp[i][j] = max(dp[i][j], dp[k-1][j-1] + pref[i] - pref[k-1]);
}
}
}
}
cout << dp[n][K] << '\n';
return 0;
}
