#include<bits/stdc++.h>
#define ll long long
using namespace std;
int v[100005],opt[205][100005];
ll sum[100005],dp[2][100005];
vector<int>ans;
void calc(int st,int dr,int st2,int dr2,int nr,int ind)
{
if (st>dr)
return ;
int mij=(st+dr)/2;
ll val=-1;
int poz=1,i;
for(i=st2;i<=min(mij-1,dr2);i++){
ll cur=dp[nr^1][i]+(sum[mij]-sum[i])*sum[i];
if (cur>val)
val=cur,poz=i;
}
opt[ind][mij]=poz;
dp[nr][mij]=val;
calc(st,mij-1,st2,poz,nr,ind);
calc(mij+1,dr,poz,dr2,nr,ind);
}
int main()
{
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
int n,k,i;
scanf("%d%d",&n,&k);
for(i=1;i<=n;i++)
scanf("%d",&v[i]),sum[i]=sum[i-1]+v[i];
for(i=1;i<=k;i++)
calc(1,n,1,n,i%2,i);
printf("%lld\n",dp[k%2][n]);
int cur=n;
for(i=k;i>=1;i--)
ans.push_back(opt[i][cur]),cur=opt[i][cur];
for(auto it=ans.rbegin();it!=ans.rend();it++)
printf("%d ",*it);
return 0;
}
