#include"bits/stdc++.h"
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class x>
using ordered_set = tree<x, null_type,less<x>, rb_tree_tag,tree_order_statistics_node_update>;
#define int long long
#define endl '\n'
#define mod 1000000007
//\
#define mod 1686876991
const int maxn = 100002;
int n, k;
int a[maxn];
int p[maxn];
unordered_map<signed,int> dp[maxn];
unordered_map<signed,signed> opts[maxn];
vector<int> v;
#define cost(l,r) ((p[r] - (l ? p[l - 1] : 0)) * (p[n-1] - p[r]))
void rec (int l, int r, int lk, int rk, int j) {
if (r < l) return;
int m = (l + r) / 2;
int opt = lk;
dp[m][j] = -1;
for (int K = lk ; K <= min(rk, m) ; K++) {
if ((K ? dp[K - 1][j - 1] : 0) + cost(K, m) > dp[m][j]) {
opt = K;
dp[m][j] = (K ? dp[K - 1][j - 1] : 0) + cost(K, m);
}
}
opts[m][j] = opt;
rec(l, m - 1, lk, opt, j);
rec(m + 1, r, opt, rk, j);
}
signed main () {
cin.tie(0)->sync_with_stdio(0);
cin >> n >> k;
for (int i = 0 ; i < n ; i++) {
cin >> a[i];
p[i] = a[i];
if (i) p[i] += p[i-1];
}
for (int i = 0 ; i < n ; i++) {
dp[i][1] = cost(0, i);
}
for (int i = 2 ; i <= k + 1 ; i++) {
rec(i - 1, n - (k - i) - 2, i - 1, n - (k - i) - 2, i);
}
cout << dp[n-1][k + 1] << endl;
int i = k + 1;
int j = n - 1;
while (i > 1) {
v.push_back(opts[j][i]);
j = opts[j][i] - 1;
i--;
}
reverse(v.begin(), v.end());
for (int i : v) cout << i << " ";
}
