/*#pragma GCC optimize("O3")
#pragma GCC target ("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")*/
#include <bits/stdc++.h>
#pragma GCC optimize ("unroll-loops,Ofast,O3")
#pragma GCC target("avx,avx2,fma")
//#define file(data) freopen(data".in", "r", stdin); freopen(data".out", "w", stdout);
#define pb push_back
//#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define all(data) data.begin() , data.end()
#define endl '\n'
//freopen("nenokku_easy.in", "r", stdin);
//freopen("nenokku_easy.out", "w", stdout);
#define int long long
#define pii pair < int, int >
#define pll pair < long long, long long >
using namespace std;
typedef long long ll;
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
int n, k, a[N], res, use, pref[N], ans;
vector < int > dv;
void rec(int l, int r, int last) {
if(l >= r) return;
last++;
while(last < dv.size() && dv[last] < l) last++;
if(last == dv.size() || r <= dv[last]) return;
int lef = pref[dv[last]] - pref[l - 1], righ = pref[r] - pref[dv[last]];
res += lef * righ;
use++;
rec(l, dv[last], last);
rec(dv[last] + 1, r, last);
}
vector < int > path;
void found(int pos, int last) {
if(pos == k) {
rec(1, n, -1);
if(res >= ans && use == k) {
ans = res;
path = dv;
}
use = 0;
res = 0;
return;
}
for(int i = last + 1; i <= n; i++) {
dv.pb(i);
found(pos + 1, i);
dv.pop_back();
}
}
main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
//file("pieaters");
cin >> n >> k;
for(int i = 1; i <= n; i++) {
cin >> a[i];
pref[i] = pref[i - 1] + a[i];
}
found(0, 0);
cout << ans << endl;
for(int i = 0; i < path.size(); i++) {
cout << path[i] << " ";
}
}
/*
7 3
4 1 3 4 0 2 3
*/
