#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve() {
int n, k;
cin >> n >> k;
vector<int> a(n + 1), pre(n + 1);
vector<vector<int>> dp(n + 1, vector<int> (k + 1));
vector<vector<pair<int, int>>> par(n + 1, vector<pair<int, int>> (k + 1));
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n; i++)
pre[i] = pre[i - 1] + a[i];
for (int i = 0; i <= n; i++)
for (int j = 0; j <= k; j++)
dp[i][j] = -pre[i] * pre[i];
for (int i = 1; i <= n; i++)
for (int j = 1; j <= k; j++) {
int mx = -1e15, xx = 0, yy = 0;
for (int l = j; l < i; l++)
if (mx <= dp[l][j - 1] + pre[l] * pre[i])
mx = dp[l][j - 1] + pre[l] * pre[i], xx = l, yy = j - 1;
dp[i][j] += mx;
par[i][j] = {xx, yy};
}
cout << dp[n][k] + pre[n] * pre[n] << '\n';
int x = n, y = k;
while (par[x][y].first) {
auto [x2, y2] = par[x][y];
cout << x2 << ' ';
x = x2, y = y2;
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int t = 1;
//cin >> t;
while (t--) {
solve();
}
}
