#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
//#include "boxes.h"
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<61);
const int inf=(1<<30);
const int nmax=1e5+50;
const int mod=1e9+7;
using namespace std;
int n,k,i,j,t,id,pr[205][nmax],c;
ll f[2][nmax],a[nmax],p[nmax],mx,x;
void rec(int l,int r,int opl,int opr)
{
if(l>r)return;
int mid=(l+r)/2,bst=0;
ll x;
for(int i=opl;i<=min(mid-1,opr);i++)
{
x=f[0][i]+(p[n]-p[mid])*(p[mid]-p[i]);
if(x>=f[1][mid])
{
f[1][mid]=x;
bst=i;
pr[c][mid]=i;
}
}
rec(l,mid-1,opl,bst);
rec(mid+1,r,bst,opr);
}
int main()
{
//freopen("sol.in","r",stdin);
//freopen("sol.out","w",stdout);
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
cin>>n>>k;
for(i=1;i<=n;i++)cin>>a[i];
for(i=1;i<=n;i++)p[i]=p[i-1]+a[i];
for(i=1;i<=k;i++)
{
c=i;
rec(1,n,0,n-1);
for(j=1;j<=n;j++)
{
f[0][j]=f[1][j];
f[1][j]=0;
}
}
/*for(i=1;i<=k;i++)
{
for(j=0;j<=n;j++)
{
for(t=j+1;t<n;t++)
{
x=f[i-1][j]+(p[t]-p[j])*(p[n]-p[t]);
if(x>=f[i][t])
{
f[i][t]=x;
pr[i][t]=j;
}
if(f[i][t]>=mx)
{
mx=f[i][t];
id=t;
}
}
}
}*/
for(i=1;i<n;i++)
{
if(mx<=f[0][i])
{
mx=f[0][i];
id=i;
}
}
cout<<mx<<endl;
for(i=k;i>=1;i--)
{
cout<<id<<" ";
id=pr[i][id];
}
cout<<endl;
return 0;
}
