#include <cstdio>
#include <algorithm>

using namespace std;
int v[10001];
int d[1002][10001],d2[1002][10001];
int main()
{
    FILE *fin=fopen ("ferma.in","r");
    FILE *fout=fopen ("ferma.out","w");
    int n,k,i,j;
    fscanf (fin,"%d%d",&n,&k);
    for (i=1;i<=n;i++)
        fscanf (fin,"%d",&v[i]);
    k++;
    //d[1][1]=v[1];
    for (j=1;j<=n;j++){
        for (i=1;i<=k;i++){
            if (i==1 && j==1){
                d[i][j]=v[j];
                continue;
            }
            d[i][j]=max(d2[i-1][j-1],d[i][j-1])+v[j];
            d2[i][j]=max(d2[i][j-1],d[i][j-1]);
        }
    }
    fprintf (fout,"%d",max(d[k][n],0));
    return 0;
}