#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
//Dijkstra->set
//set.find_by_order(x) x-position value
//set.order_of_key(x) number of strictly less elements don't need *set.??
#define wr cout << "Continue debugging\n";
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second
const int N = 100005;
const ll INF = 1e18;
int n, k, a[N];
ll pref[N];
pair<ll, vector<int>> F(int l, int r, int k){
if (l == r or k <= 0) return {0, {}};
ll mx = -INF;
vector<int> ans;
for (int i = l; i < r; i++){
ll cur = 0;
pair<ll, vector<int>> X, Y;
int l1 = 0, r1 = k-1;
while(l1 <= r1){
int md = (l1+r1)/2;
pair<ll, vector<int>> x, y;
x = F(l, i, md);
y = F(i+1, r, k-md-1);
if (cur < x.ff+y.ff){
cur = x.ff+y.ff;
X = x; Y = y;
}
if (x.ff>y.ff) r1=md-1;
else l1=md+1;
}
ll val = (pref[i]-pref[l-1])*(pref[r]-pref[i]);
if (mx < cur+val){
mx = cur+val;
ans.clear(); ans.pb(i);
ans.insert(ans.end(), all(X.ss));
ans.insert(ans.end(), all(Y.ss));
}
}
return {mx, ans};
}
int main ()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; i++){
cin >> a[i];
pref[i] = pref[i-1]+a[i];
}
pair<ll,vector<int>> ans = F(1, n, k);
cout << ans.ff << '\n';
for (auto i : ans.ss) cout << i << " ";
}
