#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<int>> par(n + 1, vector<int> (k + 1));
vector<vector<tuple<int, int, int>>> cht(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 = 1; i <= n; i++) {
for (int j = 1; j <= min(k, i - 1); j++)
if (cht[j].size())
for (auto [x, y, t] : cht[j])
if (x * pre[i] + y >= dp[i][j])
dp[i][j] = x * pre[i] + y, par[i][j] = t;
for (int j = 1; j <= min(k, i); j++)
cht[j].push_back({pre[i], dp[i][j - 1] - pre[i] * pre[i], i});
}
cout << dp[n][k]<< '\n';
for (int x = par[n][k], i = k; i >= 1; i--, x = par[x][i])
cout << x << ' ';
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int t = 1;
//cin >> t;
while (t--) {
solve();
}
}
