// duonglaptrinh
# include <bits/stdc++.h>
# define pa pair<long long, long long>
# define fi first
# define se second
using namespace std;
const int N = 1e5+5;
const long long oo = 1e18;
int n, k;
long long a[N];
long long dp[202][N], luu[202][N];
void dac(int id, int l, int r, int bl, int br) {
if(l > r) {
return;
}
int mid = (l + r) / 2;
pa best = {0, 0};
bl = max(bl, id), br = min(br, mid);
for(int i = bl; i <= br; i++) {
best = max(best, {dp[id - 1][i - 1] + (a[mid] - a[i - 1]) * (a[n] - a[mid]), i});
}
dp[id][mid] = max(dp[id][mid], best.fi);
luu[id][mid] = best.se - 1;
dac(id, l, mid - 1, bl, best.se);
dac(id, mid + 1, r, best.se, br);
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
if(fopen("nhap.inp", "r")) {
freopen("nhap.inp", "r", stdin);
freopen("nhap.out", "w", stdout);
}
cin>>n>>k;
for(int i = 1; i <= n; i++) {
cin>>a[i];
a[i] += a[i - 1];
}
for(int i = 1; i <= k; i++) {
dac(i, 1, n, 1, n);
}
pa ans = {dp[k][k], k};
for(int i = k; i <= n; i++) {
ans = max(ans, {dp[k][i], i});
}
cout<<ans.fi<<"\n";
int vt = ans.se;
for(int i = k; i >= 1; i--) {
cout<<vt<<" ";
vt = luu[i][vt];
}
return 0;
}
