#include<iostream>
#include<iomanip>
#include<algorithm>
#include<stack>
#include<queue>
#include<string>
#include<string.h>
#include<cmath>
#include<vector>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<cstdio>
#include<bitset>
#include<chrono>
#include<random>
#include<ext/rope>
/* ordered_set
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
*/
#define int long long
#define pb push_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxN = 1e5 + 5;
const int maxK = 2e2 + 5;
const int mod = 1e9 + 7;
const ll oo = 1e18;
int n, k, a[maxN], sum[maxN];
int f[maxN][maxK];
void ReadInput()
{
cin >> n >> k;
for(int i=1; i<=n; i++)
{
cin >> a[i];
sum[i] = sum[i - 1] + a[i];
}
}
int Getsum(int l, int r)
{
if(l > r) return 0;
return sum[r] - sum[l - 1];
}
void Solve()
{
//cout << get(1, n);return;
for(int i=1; i<n; i++)
{
for(int j=1; j<=k; j++)
{
for(int t=i; t>=1; t--)
{
f[i][j] = max(f[i][j], f[t - 1][j - 1] + Getsum(t, i) * Getsum(i + 1, n));
}
}
}
int res = -1;
int id = 0;
for(int i=k; i<n; i++)
{
if(res < f[i][k])
{
res = f[i][k];
id = i;
}
}
cout << res << '\n';
vector<int> trace;
trace.pb(id);
for(int i=id-1; i>=1; i--)
{
if(f[i][k - 1] + Getsum(i + 1, id) * Getsum(id + 1, n) == res)
{
trace.pb(i);
id = i;
res = f[i][k - 1];
k--;
}
}
reverse(trace.begin(), trace.end());
for(int v : trace) cout << v << " ";
}
int32_t main()
{
// freopen("x.inp", "r", stdin);
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
ReadInput();
Solve();
}
