#include <bits/stdc++.h>
using namespace std;
signed main() {
int64_t n,k; cin>>n>>k;
vector<int64_t>pref(n+1);
pref[0]=0;
for(int64_t i = 0 ; i < n ; i++) {
int64_t x; cin>>x;
pref[i+1] = pref[i] + x;
}
int64_t res[n+1][k+1];
int64_t dp[n+1][k+1];
for(int64_t i = 0 ; i <= n ; i++)
dp[i][0] = 0;
for(int64_t i = 1 ; i <= k ; i++)
dp[0][i] = 0;
for(int64_t i = 1 ; i <= k ; i++) {
for(int64_t j = 1 ; j <= n ; j++) {
dp[j][i] = 0;
for(int64_t c = 1 ; c < j ; c++) {
assert(c-1 >= 0 && i-1 >= 0 && j-1 >= 0);
if(dp[c][i-1] + (pref[n] - pref[j-1]) * (pref[j-1] - pref[c-1]) > dp[j][i]) {
res[j][i] = c;
}
dp[j][i] = max(dp[j][i],dp[c][i-1] + (pref[n] - pref[j-1]) * (pref[j-1] - pref[c-1]));
}
}
}
int64_t mx=0;
int64_t node;
vector<int64_t>ans;
for(int64_t i = 0 ; i <= n ; i++) {
if(dp[i][k] > mx) {
mx=dp[i][k];
node = i;
}
}
cout << mx << "\n";
for(int64_t i = 0 ; i < k ; i++) {
assert(node > 0);
ans.push_back(node);
node = res[node][k - i];
}
for(int64_t i = k-1 ; i >= 0 ; i--)
cout << ans[i]-1 << " ";
}
