#include <bits/stdc++.h>
using namespace std;
#define int long long
pair<int, int> dp[205][100005];
int P[100005], A[100005],n,k;
void dnc(int l, int r, int optl, int optr, int i){
if(l > r)return;
int mid = (l + r)/2, maxx = -1e9, pos = optl;
for(int j=optl;j<=min(optr, mid-1);j++){
int ans = dp[i-1][j].first + (P[mid] - P[j]) * (P[n] - P[mid]);
if(ans > maxx)maxx = ans, pos = j;
}
dp[i][mid] = make_pair(maxx,pos);
dnc(l,mid-1,optl,pos,i);
dnc(mid+1,r,pos,optr,i);
}
main(){
ios::sync_with_stdio(0);cin.tie(0);
cin >> n >> k;
for(int i=1;i<=n;i++)cin >> A[i], P[i] = P[i-1] + A[i];
for(int i=1;i<=n;i++)dp[1][i].first = (P[n] - P[i])*P[i];
for(int i=2;i<=k;i++)dnc(1,n,1,n,i);
int maxi = -1e9, in=1;
for(int i=1;i<=n;i++)if(dp[k][i].first > maxi)maxi = dp[k][i].first, in = i;
cout << maxi << '\n';
cout << in << " ";
int p = dp[k][in].second;
while(p)cout << p << " ", k--, p = dp[k][p].second;
/*
cout << "\n\n";
for(int i=1;i<=k;i++){
for(int j=i;j<=n;j++)cout << dp[i][j].first << " " << dp[i][j].second << " ";
cout << '\n';
}
*/
}
