#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll inf = 1e18;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
int n, m;
cin >> n >> m;
int a[n + 1];
ll prf[n + 1]{};
for (int i = 1; i <= n; i++) {
cin >> a[i];
prf[i] = prf[i - 1] + a[i];
}
m++;
array<ll, 2> dp[m + 1][n + 1]{};
for (int i = 1; i <= n; i++) dp[0][i] = {-inf, -1};
for (int j = 1; j <= m; j++) {
dp[j][0] = {-inf, -1};
for (int i = 1; i <= n; i++) {
for (int k = i - 1; k >= 0; k--) {
dp[j][i] = max(dp[j][i], {dp[j - 1][k][0] + prf[k] * (prf[i] - prf[k]), k});
}
}
}
cout << dp[m][n][0] << '\n';
int j = m, i = n;
vector<int> ans;
while (j > 1) {
ans.push_back(dp[j][i][1]);
i = dp[j][i][1];
j--;
}
reverse(ans.begin(), ans.end());
for (auto x : ans) {
cout << x << ' ';
}
cout << '\n';
return 0;
}
