//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//The saddest thing about betrayal? is that it never comes from your enemies
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef long long ll;
ll q, dp[205][10005], a[555555] , b[555555], k, l, m, n, o, p;
map < ll , ll > mp;
vll adj[555555];
const ll mod = 1e9+7;
str s;
ll mem(ll i , ll k1){
if(k < k1)R 1 ;
if(i >= n)R 0 ;
ll &r = dp[k1][i] ;
if(r != -1)R r ;
r = -1e15 ;
for(ll j = i ; j < n ; j++){
r = max(r , mem(j + 1 , k1 + 1) + (b[j] - b[i - 1]) * (b[n] - b[j])) ;
}
R r ;
}
vll v ;
void get(ll i , ll k1){
if(k < k1)R ;
//if(k < k1)while(1) ;
ll op = 0 , o1 = 0 ;
ll r = mem(i , k1) ;
for(ll j = i ; j < n ; j++){
//if(i)cout << o1 << " " ;
if(r == mem(j + 1 , k1 + 1) + (b[j] - b[i - 1]) * (b[n] - b[j]))o1 = j ;
}
o += (b[o1] - b[i - 1]) * (b[n] - b[o1]) ;
v.pb(o1) ;
get(o1 + 1 , k1 + 1) ;
}
void solve(){
msdp(dp) ;
cin >> n >> k ;
for(ll i = 1 ; i <= n ; i++){
cin >> a[i] ;
b[i] = b[i - 1] + a[i] ;
}
get(1 , 1) ;
cout << o << endl ;
for(auto u : v)cout << u << " " ;
}
int main(){
fast ;
//cin >> q;
q = 1;
while(q--){
solve();
}
}
