#include <bits/stdc++.h>
#define no "NO"
#define yes "YES"
#define F first
#define S second
#define vec vector
#define task "main"
#define ll long long
#define _mp make_pair
#define ii pair<int, int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define evoid(val) return void(std::cout << val)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)
#define unq(x) sort(all(x)); x.resize(unique(all(x)) - x.begin())
using namespace std;
template<typename U, typename V> bool maximize(U &a, V b) {
if (a < b) { a = b; return 1; } return 0;
}
template<typename U, typename V> bool minimize(U &a, V b) {
if (a > b) { a = b; return 1; } return 0;
}
const int N = (int)1e5 + 9;
const int INF = (int)1e9;
const int MOD = (int)1e9 + 7;
int n, k;
int a[N];
ll sum[N], dp[202][N], bestPos[202][N];
ll cost(int i, int j) {
return (sum[j] - sum[i - 1]) * (sum[n] - sum[j]);
}
void solve(int id, int l, int r, int optL, int optR) {
if (l > r) return;
int mid = (l + r) >> 1;
dp[id][mid] = 0;
FOR(i, optL, optR) {
ll newCost = dp[id - 1][i] + cost(i + 1, mid);
if (maximize(dp[id][mid], newCost)) bestPos[id][mid] = i;
}
solve(id, l, mid - 1, optL, bestPos[id][mid]);
solve(id, mid + 1, r, bestPos[id][mid], optR);
}
void main_code() {
cin >> n >> k;
FOR(i, 1, n) cin >> a[i], sum[i] = sum[i - 1] + a[i];
FOR(i, 1, n) dp[1][i] = cost(1, i);
FOR(i, 2, k + 1) solve(i, 1, n, 1, n);
cout << dp[k + 1][n] << "\n";
vector<int> trace;
int p = n, id = k + 1;
while (p > 0) {
p = bestPos[id][p];
trace.push_back(p);
id--;
}
FOD(i, k - 1, 0) cout << trace[i] << " ";
}
int main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
if (fopen(task".inp", "r")) {
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
const bool MULTITEST = 0;
int num_test = 1; if (MULTITEST) cin >> num_test;
while (num_test--) { main_code(); cout << "\n"; }
}
/* Lak lu theo dieu nhac */
