#include<bits/stdc++.h>
#pragma optimize ("g",on)
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
#pragma comment(linker, "/stack:200000000")
//01001101 01100001 01101011 01101000 01100001 01100111 01100001 01111001
using namespace std;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ll long long
#define pb push_back
#define sz(a) a.size()
#define nl '\n'
#define popb pop_back()
#define ld double
#define ull unsigned long long
#define ff first
#define ss second
#define fix fixed << setprecision
#define pii pair<int, int>
#define E exit (0)
#define int long long
const int inf = 1e9, N = 5e5 + 1, mod = 998244353;
vector<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
int dp[1001][201];
main() {
//freopen("cowrect.in", "r", stdin);
//freopen("cowrect.out", "w", stdout);
ios_base::sync_with_stdio(NULL);
cin.tie(NULL);
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++) cin >> a[i];
int pref[n + 1], suf[n + 2];
pref[0] = suf[n + 1] = 0;
for (int i = 1; i <= n; i++) pref[i] = pref[i - 1] + a[i];
for (int i = n; i >= 1; i--) suf[i] = suf[i + 1] + a[i];
for (int i = 0; i <= n; i++) {
for (int s = 1; s <= k; s++) dp[i][s] = -inf;
dp[i][0] = 0;
}
for (int i = 1; i <= n; i++) {
for (int s = 1; s <= k; s++) {
dp[i][s] = max(dp[i][s], dp[i - 1][s]);
for (int j = 0; j < i; j++) {
dp[i][s] = max(dp[i][s], dp[j][s - 1] + (pref[i] - pref[j]) * suf[i + 1]);
}
}
}
cout << dp[n][k] << nl;
int i = n, s = k;
vector<int> ans;
while (sz(ans) < k) {
if (dp[i][s] == dp[i - 1][s]) {
i--;
continue;
}
ans.pb(i);
for (int j = 0; j < i; j++) {
if (dp[i][s] == dp[j][s - 1] + (pref[i] - pref[j]) * suf[i + 1]) {
i = j;
s--;
break;
}
}
}
for (auto e: ans) cout << e << ' ';
}
