#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define OYY LLONG_MAX
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define fi first
#define se second
#define FOR for(int i=1;i<=n;i++)
#define mid (start+end)/2
#define pb push_back
#define lim 1005
//#define N 500050
typedef long long lo;
const int mod=1000000007;
int n,k;
int dizi[lim],pre[lim];
int dp[lim][lim],yol[lim][lim];
int32_t main(){
faster
cin>>n>>k;
FOR{
cin>>dizi[i];
pre[i]=pre[i-1]+dizi[i];
}
dp[0][0]=0; // 0.indeks 0.eleman alışım
FOR{
for(int j=1;j<=k;j++){
dp[i][j]=-INT_MAX;
for(int l=i-1;l>=0;l--){
if(dp[l][j-1]!=-INT_MAX && dp[i][j]<dp[l][j-1]+(pre[i]-pre[l])*(pre[n]-pre[i])){
dp[i][j]=max(dp[i][j],dp[l][j-1]+(pre[i]-pre[l])*(pre[n]-pre[i]));
yol[i][j]=l;
}
}
}
}
int cev=-INT_MAX,bas=0;
for(int i=k;i<=n;i++){
if(cev<dp[i][k]){
cev=dp[i][k];
bas=i;
}
}
vector<int> ans;
for(int i=k;i>=1;i--){
ans.pb(bas);
bas=yol[bas][i];
}
cout<<cev<<'\n';
reverse(ans.begin(),ans.end());
for(auto a:ans){
if(a)cout<<a<<" ";
else cout<<1<<endl;
}
cout<<'\n';
return 0;
}
