#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define sz size()
const int N = 1e5 + 5;
ll a[N], dp[N][205], par[N][205], p[N];
int n, k;
int main () {
// freopen ("sequence.in", "r", stdin);
// freopen ("sequence.out", "w", stdout);
// freopen ("input.txt", "r", stdin);
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
// reverse (a + 1,a + n + 1);
// for (int i = 1; i <= n; ++i) {
// p[i] = p[i - 1] + a[i];
// }
// dp[i][j] i-cenli j grupba bolemde maximum value.
p[n] = a[n];
for (int i = n - 1; i > 0; i--) {
p[i] = p[i + 1] + a[i];
for (int x = 2; x <= min (n - i + 1, k + 1); ++x) {
for (int j = i + 1; j <= min (n, i + x - 1); ++j) {
ll val = dp[j][x - 1] + p[j] * (p[i] - p[j]);
if (val >= dp[i][x]) {
// if (i == 2 and x == 2) {
// cout << "ll : " << j << " " << val << " " << p[j] << " " << (p[i] - p[j]) << "\n";
// }
dp[i][x] = val;
par[i][x] = j;
}
}
}
}
// cout << dp[1][3];
// return 0;
vector <int> cyk;
int y = k + 1, x = 1;
while (1) {
x = par[x][y];
if (!x) break;
cyk.pb (x);
y--;
}
cout << dp[1][k + 1] << "\n";
// assert ((int)cyk.sz == k);
for (int i : cyk) {
cout << i << " ";
}
return 0;
}
