#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 100'005;
const ll inf = 1e18;
int a[N];
ll prf[N];
array<ll, 2> dp[105][N];
void solve(int j, int l, int r, int optl, int optr) {
if (l > r) return;
int i = (l + r) >> 1;
for (int k = optl; k <= min(i - 1, optr); k++) {
dp[j][i] = max(dp[j][i], {dp[j - 1][k][0] + prf[k] * (prf[i] - prf[k]), k});
}
solve(j, l, i - 1, optl, dp[j][i][1]);
solve(j, i + 1, r, dp[j][i][1], optr);
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i];
prf[i] = prf[i - 1] + a[i];
}
m++;
for (int i = 1; i <= n; i++) dp[0][i] = {-inf, -1};
for (int j = 1; j <= m; j++) {
dp[j][0] = {-inf, -1};
solve(j, 1, n, 0, n - 1);
}
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;
}
