#include<bits/stdc++.h>
using namespace std;
const int maxn=10001;
const int maxm=501;
int a[maxn],dp[maxn][maxm];
int n,m;
int main(){
	freopen("cowrun.in","r",stdin);
	freopen("cowrun.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)scanf("%d",&a[i]);
	memset(dp,-0x7f,sizeof(dp));
	dp[1][0]=0;
	dp[1][1]=a[1];
	for(int i=2;i<=n;i++)
	for(int j=0;j<=m;j++){
		if(j<=i){
			if(!j){
				dp[i][j]=max(dp[i-1][0],dp[i][j]);
				for(int k=1;k<=i;k++)
				dp[i][j]=max(dp[i][j],dp[i-k][k]);
			}
			else dp[i][j]=dp[i-1][j-1]+a[i];
		}
		
	}
	/*
	for(int i=1;i<=n;i++)
	for(int j=0;j<=m;j++)
	cout<<i<<"-"<<j<<":"<<dp[i][j]<<endl;
	*/
	printf("%d\n",dp[n][0]);
	return 0;
}