#include <bits/stdc++.h>
#define int long long
#define mk make_pair
#define sc second
#define fr first
#define pb emplace_back
#define all(s) s.begin(), s.end()
#define sz(s) ( (int)s.size() )
#define Scan(a) scanf ("%I64d", &a)
#define scan(a) scanf ("%d", &a)
#define pi pair < long long, long long >
using namespace std;
const long long INF = (int)1e18 + 7;
const int N = (int)100007;
const int mod = 1000000007;
int n, k, arr[N], pr[N], par[10007][201];
int dp[N][201];
int calc(int l,int r){
return pr[l] * (pr[r] - pr[l]);
}
void solve(int k,int l,int r,int optl,int optr){
if(l > r){
return;
}
int mid = (l + r) >> 1;
int opt = optl;
dp[mid][k] = -2;
for(int i = optl;i < min(mid,optr); i++){
int cur = dp[i][k - 1] + calc(i,mid);
if(cur >= dp[mid][k]){
dp[mid][k] = cur;
opt = i;
}
}
par[mid][k] = opt;
solve(k,l,mid - 1,optl,opt);
solve(k,mid + 1,r,opt,optr);
}
main(){
cin >> n >> k;
for(int i = 1;i <= n; i++){
cin >> arr[i];
pr[i] = pr[i - 1] + arr[i];
}
for(int i = 1;i <= k; i++){
solve(i,1,n,1,n);
}
cout << dp[n][k] << '\n';
vector<int > ans;
while(par[n][k]){
ans.pb(par[n][k]);
n = par[n][k];
k--;
}
for(int i = ans.size() - 1; i >= 0; i--){
cout << ans[i] << " ";
}
}
/*
7 3
4 1 3 4 0 2 3
*/
