#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 100005;
const int inf = 1e9 + 5;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k) print the k-th smallest number in os(0-based)
int n, K;
int niz[maxn];
ll pref[maxn];
ll dp[maxn][205];
int put[maxn][205];
int main()
{
ios::sync_with_stdio(false);
cout.tie(nullptr);
cin.tie(nullptr);
cin >> n >> K;
ff(i,1,n)cin >> niz[i];
ff(i,1,n)pref[i] = pref[i - 1] + niz[i];
memset(dp, -inf, sizeof(dp));
K += 1;
dp[0][0] = 0;
ff(i,1,n){
ff(j,1,K){
fb(l,i,1){
if(dp[l - 1][j - 1] + 1ll * (pref[i] - pref[l - 1]) * (pref[n] - pref[i]) > dp[i][j]){
dp[i][j] = dp[l - 1][j - 1] + 1ll * (pref[i] - pref[l - 1]) * (pref[n] - pref[i]);
put[i][j] = l - 1;
}
}
}
}
vector<int> res;
int A = n, B = K;
while(A >= 1 && B > 0){
if(A != n)res.pb(A);
A = put[A][B--];
}
cout << dp[n][K] << endl;
reverse(all(res));
for(auto c : res)cout << c << " ";
cout << endl;
return 0;
}
/**
7 3
4 1 3 4 0 2 3
// probati bojenje sahovski ili slicno
**/
