#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back
#define F first
#define S second
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
if(a>b) swap(a,b);
if(a==0) return a+b;
return gcd(b%a,a);
}
ll lcm(ll a,ll b){
return a/gcd(a,b)*b;
}
bool is_prime(ll n){
ll k=sqrt(n);
if(n==2) return true;
if(n<2||n%2==0||k*k==n) return false;
for(int i=3;i<=k;i+=2){
if(n%i==0){
return false;
}
}
return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=2e5+5;
int t=1,n,k,arr[mxn],sum[mxn],idx[mxn],dp[mxn][205];
int funk(int ind,int k){
if(k==0) return 0;
if(dp[ind][k]!=0){
return dp[ind][k];
}
int ans=0;
for(int i=ind;i<=n-k+1;i++){
int x=(sum[i]-sum[ind-1])*(sum[n]-sum[i])+funk(i+1,k-1);
if(x>ans){
ans=x;
if(k-1>0){
idx[ind]=i+1;
}
}
}
return dp[ind][k]=ans;
}
void solve(){
cin>>n>>k;
for(int i=1;i<=n;i++){
cin>>arr[i];
sum[i]=sum[i-1]+arr[i];
}
cout<<funk(1,k)<<endl;
int x=1;
while(x!=0&&k){
k--;
x=idx[x];
cout<<x-1<<' ';
}
}
int main(){
IOS;
//cin>>t;
while(t--){
solve();
}
return 0;
}
