#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
using namespace std;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
//cout<<setprecision(20)
//cin.tie(0);
//ios::sync_with_stdio(false);
const llint mod=1000000007;
const llint big=4.19e18+1;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-15;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){return a/gcd(a,b)*b;}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
int LBI(vector<int>&ar,llint in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}
int UBI(vector<int>&ar,llint in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}
int main(void){
//愚直spit
int n,h,i,j,K;cin>>n>>K;K++;
//if(n>10000){return 0;}
vector<llint>a(n);
for(i=0;i<n;i++){cin>>a[i];}
vector<llint>wa(n+1);
for(i=0;i<n;i++){wa[i+1]=wa[i]+a[i];}
vector<vector<pair<llint,int>>>dp(K+1,vector<pair<llint,int>>(n+1,mp(-big,0)));
//スコア直接
dp[0][0]=mp(0LL,0);
for(h=1;h<=K;h++){
deque<tuple<llint,llint,int>>naf;
//こんぶなふ?
//convex full trick
//元スコア,増え方,元場所
naf.puf(mt(0LL,0LL,0));
for(i=1;i<=n;i++){
if(a[i-1]>0){
auto it=mt(dp[h-1][i].fir-wa[i]*wa[i],wa[i],i);
while(naf.size()>=2){
llint meturn=(get<0>(naf[0])-get<0>(naf[1]))/(get<1>(naf[1])-get<1>(naf[0]));
llint neturn=(get<0>(it)-get<0>(naf[1]))/(get<1>(naf[1])-get<1>(it));
if(meturn>=neturn){naf.pof();}else{break;}
}
naf.puf(it);
while(naf.size()>=2){
auto ba=naf.back();
auto me=naf[naf.size()-2];
if(get<0>(ba)+get<1>(ba)*wa[i]<get<0>(me)+get<1>(me)*wa[i]){
naf.pob();
}else{break;}
}
}
dp[h][i]=mp(get<0>(naf.back())+get<1>(naf.back())*wa[i],get<2>(naf.back()));
}
}
cout<<dp[K][n].fir<<endl;
int bas=n;
vector<bool>fuku(n+1);
for(h=K;h>1;h--){
fuku[dp[h][bas].sec]=true;
bas=dp[h][bas].sec;
}
int kazu=0;
for(i=1;i<n;i++){
if(fuku[i]){kazu++;}
}
//cerr<<kazu<<endl;
int fuso=K-1-kazu;
bas=1;
while(fuso>0){
while(fuku[bas]){bas++;}
fuku[bas]=true;fuso--;
}
for(i=1;i<n;i++){
if(fuku[i]){cout<<i<<" ";}
}
cout<<endl;
return 0;
}
