#include<cstdio>
#include<iostream>
#define mysister
#define maxn 10001
#define maxm 501
using namespace std;
int n,m,d[maxn],f[maxn][maxm],ans=0;
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",&d[i]);
    for(int i=1;i<=n;i++)
      for(int j=0;j<=m;j++)
      {
      	int last=0;
        if(!j)
		{
		  for(int k=1;k<=m&&i-k>=0;k++)last=max(last,f[i-k][k]);
		  last=max(last,f[i-1][0]);
		}
        if(j)last=max(last,f[i-1][j-1]+d[i]);
        f[i][j]=max(f[i][j],last);
      }
    printf("%d",f[n][0]);
    return 0;
}