#include <iostream>
#include <cstdio>
 
using namespace std;
 
#define MAX_N 10000
#define MAX_M 501
 
int N,M;
int Len[MAX_N];
int dp[MAX_N][MAX_M];
 
int Main()
{
	freopen("cowrun.in","r",stdin);
	freopen("cowrun.out","w",stdout);
	cin>>N>>M;
 
	for(int i=0;i<N;i++) cin>>Len[i];
 
	for(int i=1;i<=N;i++)
	{
		for(int j=1;j<i;j++)
			dp[i][0]=max(dp[i][0],dp[j][0]);
		for(int j=1;j<i;j++)
		{
			dp[i][0]=max(dp[i][0],dp[j][i-j]);
		}
 
		for(int m=1;m<=M;m++)
		{
			dp[i][m]=dp[i-1][m-1]+Len[i-1];
		}
 
	}
 
	cout<<dp[N][0]<<endl;
 
	return 0;
}
int haha=Main();
int main(){;}