#include <bits/stdc++.h>
using namespace std;
long long prefsum(long long pref[],int s, int e){
long long ans = pref[e];
if(s>e){
return 0LL;
}
if(s){
s--;
ans-=pref[s];
}
return ans;
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n,k;
cin >> n >> k;
vector<long long> arr(n);
set<array<int,2>>rangs;
long long pref[n];
for(int i = 0;i<n;i++){
cin >> arr[i];
if(arr[i]>0){
rangs.insert({i,i});
}
}
if(rangs.size()==0){
cout << 0;
return 0;
}
pref[0]=arr[0];
for(int i = 1;i<n;i++){
pref[i]=pref[i-1]+arr[i];
}
priority_queue<array<long long,3>>joins;
set<array<int,2>>::iterator it = rangs.begin();
int las = (*it)[1];
it++;
while(it!=rangs.end()){
joins.push({prefsum(pref,las+1,(*it)[0]-1),las,(*it)[0]});
//cout <<"adding to joins: "<< prefsum(pref,las+1,(*it)[0]-1) << " " << las << " " << (*it)[0] << "\n";
las=(*it)[1];
it++;
}
set<array<long long,3>>rangsums;
for(array<int,2> a : rangs){
rangsums.insert({prefsum(pref,a[0],a[1]),a[0],a[1]});
//cout << "adding to rangsums: " << prefsum(pref,a[0],a[1]) << " " << a[0]<< " " <<a[1] << "\n";
}
while(rangsums.size()>k){
rangsums.erase(rangsums.begin());
}
long long ans = 0;
long long sum = 0;
for(array<long long,3>a : rangsums){
sum+=a[0];
}
ans=max(ans,sum);
while(joins.size()){
array<long long,3>curr = joins.top();
joins.pop();
set<array<int,2>>::iterator it = rangs.lower_bound({curr[2],-1});
array<int,2>up = *it;
it--;
array<int,2>down = *it;
rangs.erase(up);
rangs.erase(down);
//cout << "finding: " << prefsum(pref,down[0],down[1]) << " " << down[0] << " " << down[1] << "\n";
set<array<long long,3>>::iterator c = rangsums.find({prefsum(pref,down[0],down[1]),down[0],down[1]});
if(c!=rangsums.end()){
rangsums.erase(c);
// cout << "erased: " << prefsum(pref,down[0],down[1]) << " " << down[0] << " " << down[1] << "\n";
sum-=prefsum(pref,down[0],down[1]);
assert(prefsum(pref,down[0],down[1])>0);
}
//cout << "finding: " << prefsum(pref,up[0],up[1]) << " " << up[0] << " " << up[1] << "\n";
c = rangsums.find({prefsum(pref,up[0],up[1]),up[0],up[1]});
if(c!=rangsums.end()){
rangsums.erase(c);
// cout << "erased: " << prefsum(pref,up[0],up[1]) << " " << up[0] << " " << up[1] << "\n";
sum-=prefsum(pref,up[0],up[1]);
assert(prefsum(pref,up[0],up[1])>0);
}
rangs.insert({down[0],up[1]});
if(prefsum(pref,down[0],up[1])>0){
rangsums.insert({prefsum(pref,down[0],up[1]),down[0],up[1]});
//cout << "adding: " << prefsum(pref,down[0],up[1]) << " " << down[0] << " " << up[1] << "\n";
sum+=prefsum(pref,down[0],up[1]);
assert(prefsum(pref,down[0],up[1])>0);
}
while(rangsums.size()>k){
array<long long,3>curr = *rangsums.begin();
sum-=curr[0];
assert(curr[0]>0);
//cout << "erased: " << curr[0] << " " << curr[1] << " " << curr[2] << "\n";
rangsums.erase(rangsums.begin());
}
sum=0;
vector<long long>sums;
for(array<int,2>a:rangs){
sums.push_back(prefsum(pref,a[0],a[1]));
}
sort(sums.rbegin(),sums.rend());
for(int i = 0;i<sums.size()&&i<k;i++){
if(sums[i]<0)
continue;
sum+=sums[i];
}
ans=max(ans,sum);
}
cout << ans;
return 0;
}
