#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define ll long long
#define ld long double
#define all(_v) _v.begin(), _v.end()
#define sz(_v) (int)_v.size()
#define pii pair <int, int>
#define pll pair <ll, ll>
#define veci vector <int>
#define vecll vector <ll>
const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, -1, 1};
const double PI = 3.1415926535897932384626433832795;
const double eps = 1e-9;
const int MOD1 = 1e9 + 7;
const int MOD2 = 998244353;
const int MAXN = 1e5 + 10;
ll pref[MAXN];
ll dp[MAXN][2];
int opt[MAXN][220];
int n, K;
void calc(int k, int l, int r, int optl, int optr) {
if(l > r) return;
int m = l + r >> 1;
ll res = -1e18;
opt[m][k] = optl;
for(int i = optl; i <= min(m - 1, optr); ++i) {
ll cur = dp[i][(k & 1) ^ 1] + pref[i] * (pref[m] - pref[i]);
if(cur > res) {
res = cur;
opt[m][k] = i;
}
}
dp[m][k & 1] = res;
calc(k, l, m - 1, optl, opt[m][k]);
calc(k, m + 1, r, opt[m][k], optr);
}
void solve() {
cin >> n >> K;
for(int i = 1; i <= n; ++i) {
ll x;
cin >> x;
pref[i] = pref[i - 1] + x;
}
for(int i = 1; i <= K; ++i)
calc(i, i, n, i, n);
veci ans;
int pos = n;
for(int i = K; i > 0; --i)
pos = opt[pos][i], ans.pb(pos);
reverse(all(ans));
cout << dp[n][K & 1] << '\n';
for(auto it : ans) cout << it << ' ';
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int T = 1;
///cin >> T;
while(T--) solve(), cout << '\n';
return 0;
}
/**
7 3
4 1 3 4 0 2 3
*/
