#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#include<bits/extc++.h>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using vi = vector<ll>;
using vvi = vector<vector<ll>>;
const ll mod = 998244353;
using oset = tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
using vec = pair<ll, ll>;
using ld = long double;
ll dot(vec a, vec b) {
return a.first*b.first + a.second*b.second;
}
struct cht {
vector<vec> hull;
vector<int> id;
void clear() {
hull.clear();
id.clear();
}
bool nok(ld x, ld y, ld x1, ld y1, ld x2, ld y2) {
return (y1 - y)*(x2 - x1) - (y2 - y1)*(x1 - x) < (1e-3);
}
bool rem() {
int n = hull.size();
if (n < 3)
return 0;
return nok(hull[n - 3].first, hull[n - 3].second, hull[n - 2].first,
hull[n - 2].second, hull[n - 1].first, hull[n - 1].second);
}
void add(vec x, int i) {
hull.pb(x);
id.pb(i);
while (rem()) {
swap(hull.back(), hull[hull.size() - 2]), hull.pop_back();
swap(id.back(), id[id.size() - 2]), id.pop_back();
}
}
ll get(vec x, int &v) {
ll l = 0, r = (int)hull.size() - 1, a;
while (r - l > 3) {
a = l + (r - l) / 2;
if (dot(x, hull[a]) < dot(x, hull[a+1]))
l = a;
else
r = a+1;
}
ll ans = 0;
while (l <= r) {
ll t = dot(x, hull[l]);
if(ans < t)
v = id[l], ans = t;
l++;
}
return ans;
}
};
const int MK = 220, MN = 1e5 + 3;
ll n, a[MN], pref[MN], dp[2][MN];
int p[MK][MN];
vi z;
void bt(int a, int b) {
if(!b)return;
z.pb(b);
if (a > 1)
bt(a - 1, p[a][b]);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i], pref[i] = pref[i - 1] + a[i];
}
ll ans = -1, g = n - 1;
cht x;
for (int at = 1; at <= k; at++) {
int a = at&1;
x.clear();
// if(a==1)
x.add(vec(0, 0), 0);
for (int i = 1; i < n; i++) {
if(i>=at) {
dp[a][i] = x.get(vec(1, pref[n]-pref[i]), p[at][i]) + pref[i]*(pref[n]-pref[i]);
// p[a][i] = bc[-t.imag()];
// cout << -t.real() << " ";
ans = max(ans, dp[a][i]);
if (ans == dp[a][i])
g = i;
}else dp[a][i] = dp[a^1][i];
x.add(vec(dp[a^1][i], -pref[i]), i);
}
}
cout << ans << '\n';
bt(k, g);
set<int> xx;
for(auto i : z)
cout << i << " ", xx.insert(i);
int v = 1;
while(z.size() < k) {
while(xx.count(v)){v++;}
xx.insert(v);
z.pb(v);
cout << v << " ";
}
}
