//----------vahagng----------//
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
// template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
void print(long long t) { cerr << t; }
void print(int t) { cerr << t; }
void print(string t) { cerr << t; }
void print(char t) { cerr << t; }
void print(double t) { cerr << t; }
void print(long double t) { cerr << t; }
void print(unsigned long long t) { cerr << t; }
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[], V n) { cerr << "["; for (int i = 0; i < n; i++) { cerr << v[i] << " "; } cerr << "]"; }
template <class T, class V> void print(pair <T, V> p) { cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}"; }
template <class T> void print(vector <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(set <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(unordered_set <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(multiset <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T, class V> void print(map <T, V> v) { cerr << "[ "; for (auto i : v) { print(i); cerr << " "; } cerr << "]"; }
#define ll long long
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define ld long double
#define sz(v) v.size()
#define endl '\n'
const ll inf = 2e18, mod = 1e9 + 7, mod2 = 998244353, mod3 = 1e9 + 9;
void SetIO(string str = "") {
if (str != "") {
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
}
else {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
}
void FastIO() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
}
const int N = 3e5 + 10, M = 2e7 + 10;
mt19937 rnd(chrono::system_clock::now().time_since_epoch().count());
ll binpow(ll a, ll b, ll m) {
ll res = 1;
while (b) {
if (b & 1) {
res = (res * a) % m;
}
b >>= 1;
a = (a * a) % m;
}
return res;
}
__int128_t gcd(__int128_t a, __int128_t b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
__int128_t lcm(__int128_t a, __int128_t b) {
return a / gcd(a, b) * b;
}
ll n, k, a[N], p[N], dp1[100001], dp2[100001], par[100001][201], pre[1001][202];
ll C(int l, int r){
return (p[r] - p[l - 1]) * (p[n] - p[r]);
}
void rec(int l, int r, int lx, int rx, int K) {
if (l > r) return;
int m = (l + r) / 2;
pair<ll, ll> mx = { -inf, -1 };
for (int i = lx; i <= min(m, rx); i++) {
mx = max(mx, { dp2[i - 1] + C(i, m), i });
}
dp1[m] = mx.first;
par[m][K] = mx.second - 1;
rec(l, m - 1, lx, mx.second, K);
rec(m + 1, r, mx.second, rx, K);
}
void solve(int tc) {
cin >> n >> k;
for(int i = 1; i <= n; i++){
cin >> a[i];
p[i] = p[i - 1] + a[i];
}
// for (int K = 2; K <= k; K++) {
// for (int i = K; i <= n; i++) {
// for (int j = i; j >= K - 1; j--) {
// if (dp1[i] < dp1[j - 1][K - 1] + (p[n] - p[i]) * (p[i] - p[j - 1])) {
// dp[i][K] = dp[j - 1][K - 1] + (p[n] - p[i]) * (p[i] - p[j - 1]);
// par[i][K] = j - 1;
// }
// }
// }
// }
for (int j = 0; j < k; j++) {
rec(1, n, 1, n, j + 1);
for (int i = 1; i <= n; i++) dp2[i] = dp1[i];
}
ll ans = -inf, id = -1;
for(int i = 1; i <= n; i++){
if(ans < dp1[i]){
ans = dp1[i];
id = i;
}
}
cout << ans << endl;
int cur = id, j = k;
if (k == 1) {
cout << cur << endl;
return;
}
vector<int>v;
while (cur) {
v.push_back(cur);
cur = par[cur][j];
j--;
}
reverse(all(v));
for(auto i : v) cout << i << ' ';
cout << endl;
}
void precalc() {
}
int main() {
// SetIO("teamwork");
FastIO();
int test_case = 1;
// cin >> test_case;
precalc();
int cnt = 1;
while (test_case--) {
solve(cnt++);
}
return 0;
}
