#include <algorithm>
#include <iostream>
#include <limits>
#include <vector>
using namespace std;
namespace {
using ll = long long;
constexpr auto inf = std::numeric_limits<ll>::max();
ll plus(ll a, ll b)
{
if (a <= -inf || b <= -inf) return -inf;
return a + b;
}
ll plus(ll a, ll b, ll c)
{
return plus(a, plus(b, c));
}
ll solve(vector<ll> const& data, ll m)
{
int n = data.size();
vector<ll> psum(n + 1);
psum[0] = 0;
for (int i = 0; i < n; ++i) {
psum[i + 1] = psum[i] + data[i];
}
auto sum = [&](int l, int r) { return psum[r] - psum[l]; };
int B = 0;
while ((1LL << B) - 1 < m) ++B;
vector<vector<vector<ll>>> tmp(n + 1, vector<vector<ll>>(n + 1, vector<ll>(B + 1, -inf)));
for (int i = 0; i <= n; ++i) {
for (int b = 0; b <= B; ++b) {
tmp[i][i][b] = 0;
}
if (i < n) tmp[i][i+1][0] = 0;
}
for (int d = 1; d <= n; ++d) {
for (int l = 0; l <= n - d; ++l) {
int r = l + d;
for (int b = 1; b <= B; ++b) {
auto& dest = tmp[l][r][b];
dest = tmp[l][r][b - 1];
for (int c = l; c <= r; ++c) {
dest = max(dest, plus(tmp[l][c][b-1], tmp[c][r][b-1], sum(c, r)));
}
}
}
}
vector<vector<ll>> res(n + 1, vector<ll>(B + 1, -inf));
for (int b = 0; b <= B; ++b) res[n][b] = 0;
if (n > 0) res[n-1][0] = 0;
for (int l = n; l >= 0; --l) {
for (int b = 1; b <= B; ++b) {
auto& dest = res[l][b];
dest = res[l][b - 1];
if ((m & (1LL << (b - 1))) == 0) continue;
for (int c = l; c <= n; ++c) {
dest = max(dest, plus(tmp[l][c][b-1], res[c][b-1], sum(c, n)));
}
}
}
return res[0][B]; // XXX, końcówka
}
}
int main()
{
iostream::sync_with_stdio(false);
cin.tie(nullptr);
int n;
ll m;
cin >> n >> m;
vector<ll> data(n);
for (auto& x: data) cin >> x;
cout << solve(data, m) << endl;
return 0;
}