//```// YF YUSUF
// #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <queue>
#include <stack>
#include <cassert>
#include <climits>
#include <string>
#include <cstdlib>
#include <random>
#include <iomanip>
#include <ctime>
using namespace std;
#ifdef YF_CHECK
bool LOCAL = 1;
#else
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("O3")
bool LOCAL = 0;
#endif
using i128 = __int128;
using ll = long long;
using ld = long double;
using vll = vector <ll>;
using mll = map <ll,ll>;
using pll = pair <ll,ll>;
using vvl = vector <vll>;
using vpll = vector <pll>;
template<class T>T MIN(T&a,T b){a=min(a,b);return a;}
template<class T>T MAX(T&a,T b){a=max(a,b);return a;}
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sgr v+v+1,(tl+tr)/2+1,tr
#define sgl v+v,tl,(tl+tr)/2
#define pb push_back
#define ins insert
#define S second
#define F first
mt19937_64 MT(time(0));
ll BP(ll a,ll b,ll mod=1e9+7){
if(b==0)return 1;
ll q=BP(a,b/2,mod);
return ((q*q)%mod*(b%2?a:1ll))%mod;
}
ll f(ll x){return x*(x+1)/2;}
ll dup(ll a,ll b){return (a+b-1)/b;}
ll lcm(ll a,ll b){return a/__gcd(a,b)*b;}
ll invf(ll x){return (-1+sqrt(1+8*x))/2;}
ll lg(ll x){return (x ? 63 - __builtin_clzll(x) : -1);}
const ll mod=998244353;
const ll INF=1e18;
const ll inf=1e9+7;
const ll N =1e5+7;
ll n, K;
ll a[N], p[N];
int pos[201][N];
vll dprev(N);
vll dcurr(N);
ll k[N];
ll b[N];
struct line{
ll k, b, j;
line(ll K,ll B,ll J):k(K),b(B),j(J){};
ll get(ll x){
return x*k + b;
}
} worst = {0, -INF, 0};
bool bad(line a, line b, line c){
ll A = (b.b - a.b) * (b.k - c.k);
ll B = (c.b - b.b) * (a.k - b.k);
return A <= B;
}
deque <line> dq;
void add(line a){
while(dq.size() > 1 && bad(dq[dq.size() - 2], dq[dq.size() - 1], a))
dq.pop_back();
dq.push_back(a);
}
pll get(ll x){
while(dq.size() > 1 && dq[0].get(x) <= dq[1].get(x))
dq.pop_front();
line a =dq.front();
return {a.j, a.get(x)};
}
void YF_MAIN(ll TEST){
cin>>n>>K;
for(int i=1;i<=n;i++){
cin>>a[i];
p[i] = p[i-1] + a[i];
}
pll ans = {0, 0};
for(int k = 1; k <= K; k++){
swap(dprev, dcurr);
// for(int i = 0 ; i < k-1; i++){
// cout.width(2);
// cout<<-1<<" ";
// }
for(int i = k; i < n; i++){
add({-p[i-1], dprev[i-1], i-1});
auto [j, x] = get(p[n] - p[i]);
dcurr[i] = x + (p[n] - p[i]) * p[i];
pos[k][i] = j;
MAX(ans, {dcurr[i], i});
// cout.width(2);
// cout<<dcurr[i]<<" ";
// cout<<j<<" ";
}
dq.clear();
// cout<<"\n";
}
vll vans = {ans.S};
for(int k = K; k>1; k--){
vans.pb(pos[k][vans.back()]);
}
reverse(all(vans));
cout<<ans.F<<"\n";
for(auto i : vans)cout<<i<<" ";
}
const bool TECT=0;
const bool FLSH=1;
const ll SN=1e0 + 7; ll SM[SN];
const ll FN=1e0 + 7; ll FACT[FN], inv[FN], FMOD=inf;
ll PER(ll n,ll k){return FACT[n] *inv[n-k]%FMOD;}
ll CNK(ll n,ll k){return PER(n,k)*inv[k ]%FMOD;}
void BEFORE(){
for(ll i=2;i<SN;i++){
if(SM[i])continue;
for(ll j=i;j<SN;j+=i)
MAX(SM[j],i);
}
FACT[0]=inv[0]=1;
for(int i=1;i<FN;i++){
FACT[i]=FACT[i-1]*i%FMOD;
inv[i]=BP(FACT[i],FMOD-2,FMOD);
}
}
signed main(){
// freopen(("input.txt"),"r",stdin);freopen(("output.txt"),"w",stdout);
if(FLSH){
ios_base::sync_with_stdio(0);
cout.setf(ios::fixed);
cout.precision(0);
cout.tie(0);
cin.tie(0);
}
cout<<(0 && LOCAL ? "\nYF_OUTPUT:\n\n" : "");
int TEST=1;
if(TECT)
cin>>TEST;
BEFORE();
for(int T=1;T<=TEST;T++){
// cout<<"Case "<<T<<": ";
YF_MAIN(T);
cout<<(T==TEST ? "" : "\n");
}
return 0;
}
// YF YUSUF ```
