#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int INF = (int) 1e9 + 1e6 + 123;
const ll LINF = (ll) 1e18 + 1e9 + 123;
const ld EPS = (ld) 1e-7;
const ll MOD = (ll) 1e9 + 7;
#define sz(x) (int) (x).size()
#define mp(x, y) make_pair(x, y)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lb(s, t, x) (int) (lower_bound(s, t, x) - s)
#define ub(s, t, x) (int) (upper_bound(s, t, x) - s)
#define rep(i, f, t) for (int i = f; i < t; i++)
#define per(i, f, t) for (int i = f; i >= t; i--)
ll power(ll x, ll y, ll mod = MOD) {
if (y == 0) {
return 1;
}
if (y & 1) {
return power(x, y - 1, mod) * x % mod;
} else {
ll tmp = power(x, y / 2, mod);
return tmp * tmp % mod;
}
}
template<typename A, typename B> bool mini(A &x, const B &y) {
if (y < x) {
x = y;
return true;
}
return false;
}
template<typename A, typename B> bool maxi(A &x, const B &y) {
if (y > x) {
x = y;
return true;
}
return false;
}
void add(ll &x, ll y) {
x += y;
if (x >= MOD) x -= MOD;
if (x < 0) x += MOD;
}
ll mult(ll x, ll y) {
return x * y % MOD;
}
void run();
#define TASK ""
int main() {
#ifdef LOCAL
if (strlen(TASK) > 0) {
cerr << "Reminder: you are using file i/o, filename: " TASK "!" << endl << endl;
}
#endif
#ifndef LOCAL
if (strlen(TASK)) {
freopen(TASK ".in", "r", stdin);
freopen(TASK ".out", "w", stdout);
}
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#endif
cout << fixed << setprecision(12);
run();
return 0;
}
// == SOLUTION == //
const int N = 55;
int n, k;
ll a[N], p[N];
ll dp[N][N][N];
pair<int, int> from[N][N][N];
ll get(int l, int r) {
return p[r] - p[l - 1];
}
vector<int> what;
void look(int l, int r, int k) {
if (k == 0) {
return;
}
int pos = from[l][r][k].first;
int x = from[l][r][k].second;
look(l, pos, x);
what.pb(pos - 1);
look(pos, r, k - x - 1);
}
void run() {
cin >> n >> k;
rep(i, 1, n + 1) {
cin >> a[i];
}
partial_sum(a, a + n + 1, p);
rep(len, 2, n + 1) {
rep(l, 1, n - len + 2) {
int r = l + len;
rep(mid, l + 1, r) {
ll L = get(l, mid - 1);
ll R = get(mid, r - 1);
rep(t, 1, k + 1) {
rep(x, 0, t) {
if (maxi(dp[l][r][t], dp[l][mid][x] + dp[mid][r][t - x - 1] + L * R)) {
from[l][r][t] = {mid, x};
}
}
}
}
}
}
cout << dp[1][n + 1][k] << "\n";
look(1, n + 1, k);
for (int pos : what) {
cout << pos << " ";
}
cout << "\n";
}
