#include <bits/stdc++.h>
#define ll int64_t
#define ld long double
using namespace std;
//
const int maxn =1e5+5;
const int mod = 1e9+7; // 998244353,1610612741
const ll inf = 1e18;
const ld pi = atan(1.0L)*4;
int n,K;
int pre[205][maxn];
ll a[maxn],f[205][maxn],s[maxn];
int main() {
// freopen("../input.inp","r",stdin);
// freopen("output.out","w",stdout);
ios::sync_with_stdio(false);
cin.tie(nullptr);
clock_t start,end;
start=clock();
memset(f,0x3f3f3f3f,sizeof(f));
cin >>n>>K;
K++;
for (int i=1;i<=n;i++) cin >>a[i],s[i]=s[i-1]+a[i];
for (int i=1;i<=n;i++) f[1][i]=s[i]*s[i];
for (int k=2;k<=K;k++) {
for (int i=1;i<=n;i++) {
ll val=inf;
int pos=0;
for (int j=1;j<=i;j++) {
if (f[j-1][k-1]+(s[i]-s[j-1])*(s[i]-s[j-1])<val) {
val=f[j-1][k-1]+(s[i]-s[j-1])*(s[i]-s[j-1]);
pos=j;
}
}
f[i][k]=val;
pre[i][k]=pos;
}
}
cout <<(s[n]*s[n]-f[n][K])/2<<'\n';
int i=n,j=K;
vector<int> v;
while (i) {
i=pre[i][K--];
if (i) v.push_back(i);
}
sort(v.begin(),v.end());
for (auto i:v) cout <<i-1<<" ";
end=clock();
ld dur=(ld)(end-start)/(ld)(CLOCKS_PER_SEC)*(1000.0L);
cerr<<dur<<'\n';
return 0;
}
