#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<limits.h>
#include<math.h>
#include<map>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<iomanip>
#include<cstring>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;
//const int MOD=1e9+7;
//typedef pair<ll,ll>Point;
//typedef pair<ll,ll>Line;
//#define x first
//#define y second
int n,k;
ll dp[10001][201];
int chosen[100001][201];
int arr[100000];
ll ps[100001];
void solve(){
cin>>n>>k;
for(int i=0;i<n;i++)
cin>>arr[i];
for(int i=1;i<=n;i++)
ps[i]=ps[i-1]+arr[i-1];
for(int j=1;j<=k;j++){
for(int i=1;i<=n;i++){
for(int i2=0;i2<i;i2++){
ll curr=dp[i2][j-1]+ps[i2]*(ps[i]-ps[i2]);
if(curr>=dp[i][j]){
dp[i][j]=curr;
chosen[i][j]=i2;
}
}
}
}
cout<<dp[n][k]<<"\n";
int curr=n;
for(int j=k;j>0;j--){
cout<<chosen[curr][j]<<" ";
curr=chosen[curr][j];
}
cout<<"\n";
}
int main(){
ios::sync_with_stdio(false);cout.tie(NULL);cin.tie(NULL);
//freopen("bank.in","r",stdin);freopen("bank.out","w",stdout);
int t=1;//cin>>t;
while(t--)solve();
return 0;
}
/*
7 3
4 1 3 4 0 2 3
*/
