1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
#include <iostream>
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <time.h>
#include <stdlib.h>
#include <string>
#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <sstream>
#include <stack>
#include <iomanip>
#include <assert.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef pair<int,int> pii;
typedef long long ll;
typedef double ld;
typedef vector<int> vi;
#define fi first
#define se second
#define fe first
#define FO(x) {freopen(#x".in","r",stdin);freopen(#x".out","w",stdout);}
#define Edg int M=0,fst[SZ],vb[SZ],nxt[SZ];void ad_de(int a,int b){++M;nxt[M]=fst[a];fst[a]=M;vb[M]=b;}void adde(int a,int b){ad_de(a,b);ad_de(b,a);}
#define Edgc int M=0,fst[SZ],vb[SZ],nxt[SZ],vc[SZ];void ad_de(int a,int b,int c){++M;nxt[M]=fst[a];fst[a]=M;vb[M]=b;vc[M]=c;}void adde(int a,int b,int c){ad_de(a,b,c);ad_de(b,a,c);}
#define es(x,e) (int e=fst[x];e;e=nxt[e])
#define esb(x,e,b) (int e=fst[x],b=vb[e];e;e=nxt[e],b=vb[e])
#define SZ 66666
int n; ll m,a[SZ],su[SZ];
int bb[23333],bn;
ll f[66][2][205][205];
int main()
{
	scanf("%d%lld",&n,&m);
	while(m)
		bb[++bn]=m&1,m>>=1;
	for(int i=1;i<=n;++i)
		scanf("%lld",a+i),
		su[i]=su[i-1]+a[i];
	//0: escaped, 1: not escaped
	for(int i=1;i<=n;++i)
		for(int j=i+1;j<=n;++j)
			f[0][0][i][j]=f[0][1][i][j]=-2e18;
	for(int i=1;i<=n;++i)
		f[0][0][i][i]=0,
		f[0][1][i][i]=0;
	for(int u=1;u<=bn;++u)
	{
		for(int i=1;i<=n;++i)
			for(int j=i;j<=n;++j)
			{
				ll&F0=f[u][0][i][j],&F1=f[u][1][i][j];
				F0=F1=-2e18;
				for(int k=i;k<=j+1;++k)
				{
					F0=max(F0,f[u-1][0][i][k-1]+f[u-1][0][k][j]+su[j]-su[k-1]);
					if(bb[u]==0&&k!=j+1) continue;
					F1=max(F1,f[u-1][bb[u]==0][i][k-1]+f[u-1][1][k][j]+su[j]-su[k-1]);
				}
			}
	}
	cout<<f[bn][1][1][n]<<"\n";
}