#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
#define pv pair<ll,vector<int>>
const int N = 55;
const ll INF = 1e18;
int n, k, a[N];
ll pref[N];
pair<ll, vector<int>> dp[N][N];
// pair<ll, vector<int>> F(int l, int r, int j, int m){
// ll val = (pref[m]-pref[l-1])*(pref[r]-pref[m]), cur=0;
// pv X, Y;
// int l1 = 0, r1 = j-1;
// while(l1 <= r1){
// int md = (l1+r1)/2;
// pv x, y;
// x = dp[l][m][md];
// y = dp[m+1][r][j-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;
// }
// vector<int> ans;
// ans.insert(ans.end(), all(X.ss));
// ans.pb(m);
// ans.insert(ans.end(), all(Y.ss));
// return {cur+val, 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];
}
for (int i = 2; i <= n; i++){
for (int x = 1; x <= k; x++){
for (int j = 1; j < i; j++){
pv X = dp[j][x-1];
X.ss.pb(j);
dp[i][x] = max(dp[i][x], {X.ff+(pref[i]-pref[j])*pref[j], X.ss});
}
}
}
cout << dp[n][k].ff << '\n';
for (auto i : dp[n][k].ss) cout << i << " ";
}
