#include <bits/stdc++.h>
using namespace std;
#define name "splitsequence"
#define MAXN 100005
#define pb push_back
#define pf push_front
#define ll long long
#define ii pair<int, int>
#define fs first
#define sc second
#define ill pair<int, ll>
#define lli pair<ll, int>
#define llll pair<ll, ll>
#define all(v) v.begin(),v.end()
#define uni(v) v.erase(unique(all(v)),v.end())
#define bit(n,i) (((n)>>(i))&1)
#define FOR(i,a,b) for (int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for (int i=(a),_b=(b); i>=_b; i--)
#define MASK(i) (1LL<<(i))
const int INF=1e9;
const int MOD=1e9+7;
void add(int &u, int v){
u+=v;
if (u>=MOD) u-=MOD;
}
void sub(int &u, int v){
u-=v;
if (u<0) u+=MOD;
}
void minimize(int &u, int v){
u=min(u,v);
}
bool maximize(ll &u, ll v){
if (u<=v){
u=v;
return 1;
}
return 0;
}
long long Rand(long long l, long long r){
ll tmp=0;
FOR(i,1,4) tmp=((tmp<<15)^(((1<<15)-1)&rand()));
return l+tmp%(r-l+1);
}
int n,k;
int a[MAXN];
ll dp[MAXN][2];
int trace[MAXN][202];
int sum[MAXN];
int get(int l, int r){
return sum[r]-sum[l-1];
}
void dnc(int g, int l, int r, int optL, int optR){
if (l>r) return;
int mid=(l+r)/2;
FOR(i,max(trace[mid][g-1],optL),min(mid-1,optR)){
ll cost=dp[i][(g&1)^1]+1LL*get(i+1,mid)*get(mid+1,n);
if (maximize(dp[mid][g&1],cost)){
trace[mid][g]=i;
}
}
dnc(g,l,mid-1,optL,trace[mid][g]);
dnc(g,mid+1,r,trace[mid][g],optR);
}
int main()
{
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin>>n>>k;
FOR(i,1,n) cin>>a[i];
FOR(i,1,n) sum[i]=sum[i-1]+a[i];
memset(dp,-0x3f,sizeof(dp));
dp[0][0]=0;
ll res=0;
int u=-1;
FOR(g,1,k){
dnc(g,g,n-1,g-1,n);
FOR(i,g,n-1){
if (maximize(res,dp[i][g&1])){
u=i;
}
}
}
cout<<res<<"\n";
int v=k;
vector<int> vec;
while (u>0){
vec.pb(u);
u=trace[u][v];
--v;
}
reverse(all(vec));
for (int x:vec) cout<<x<<" ";
return 0;
}
