#include <stdio.h>
#define MAXN 10000
int v[MAXN+1], a[2][MAXN+1], b[2][MAXN+1];
int main(){
    int n, k, i, j;
    FILE *fin, *fout;
    fin=fopen("ferma.in", "r");
    fout=fopen("ferma.out", "w");
    fscanf(fin, "%d%d", &n, &k);
    for(i=1; i<=n; i++){
        fscanf(fin, "%d", &v[i]);
    }
    for(i=0; i<=k; i++){
        for(j=1; j<=n; j++){
            a[i&1][j]=a[i&1][j-1];
            if(a[i&1][j]<b[(i+1)&1][j-1]){
                a[i&1][j]=b[(i+1)&1][j-1];
            }
            if(a[i&1][j]<a[(i+1)&1][j-1]){
                a[i&1][j]=a[(i+1)&1][j-1];
            }
            a[i&1][j]+=v[j];
            b[i&1][j]=a[i][j-1];
            if(b[i&1][j]<b[i][j-1]){
                b[i&1][j]=b[i][j-1];
            }
        }
    }
    fprintf(fout, "%d\n", a[k&1][n]);
    fclose(fin);
    fclose(fout);
    return 0;
}