/// adil sultanov | vonat1us
#pragma GCC optimize("O3")
//#pragma comment(linker, "/STACK:36777216")
#include<bits/stdc++.h>
#define x first
#define y second
#define pb push_back
#define sz(x) (int) x.size()
#define all(z) (z).begin(), (z).end()
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 1e2;
void fin() {
#ifdef AM
freopen(".in", "r", stdin);
#endif
}
const bool flag = 0;
const int N = 1e3+10;
const int K = 210;
ll p[N], dp[N][K], pr[N][K];
void f(int r, int k) {
if (k == 1) return;
int cut = pr[r][k];
cout << cut+1 << " ";
f(cut, k-1);
}
void ma1n() {
int n, k;
cin >> n >> k;
k++;
vector<int> a(n);
for (int& x : a) {
cin >> x;
}
for (int i = 0; i < n; ++i) {
p[i] = (i ? p[i-1] : 0ll)+a[i];
}
memset(pr, -1, sizeof(pr));
for (int l = 2; l <= k; ++l) {
for (int i = 0; i < n; ++i) {
for (int j = 0; j < i; ++j) {
ll res = dp[j][l-1] + (p[i]-p[j])*p[j];
if (res >= dp[i][l]) {
dp[i][l] = res, pr[i][l] = j;
}
}
}
}
cout << dp[n-1][k] << "\n";
f(n-1, k);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(nullptr), fin();
int ts = 1;
if (flag) {
cin >> ts;
}
while (ts--) {
ma1n();
}
return 0;
}
