#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
#define pii pair<int, int>
#define ff first
#define ss second
#define entire(x) (x).begin(), (x).end()
int32_t main(){
ios::sync_with_stdio(false); cin.tie(nullptr);
int n, k; cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
vector<vector<int>> dp(n, vector<int>(k + 1, 0)), pf(n, vector<int>(k + 1, 0));
if (a[0] > 0) for (int i = 0; i <= k; i++) dp[0][i] = pf[0][i] = a[0];
for (int i = 1; i < n; i++) for (int j = 1; j <= k; j++){
dp[i][j] = max(dp[i-1][j], pf[i-1][j-1] + a[i]);
pf[i][j-1] = max(a[i] + pf[i-1][j-1], dp[i][j-1]);
}
int ans = 0;
for (int i = 0; i < n; i++) ans = max(ans, dp[i][k]);
cout << ans << endl;
return 0;
}
