#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using T = __int128_t;
struct Line{
T a, b; int i;
Line() = default;
Line(T a, T b, int i) : a(a), b(b), i(i) {}
T f(T x){ return a * x + b; }
};
struct CHT{
vector<Line> v; int p;
CHT() : v(), p(0) {}
bool check(Line a, Line b, Line c){
return (a.b - c.b) * (b.a - a.a) <= (a.b - b.b) * (c.a - a.a);
}
void add(Line l){
while(p + 1 < v.size() && (v.back().b <= l.b || check(v[v.size()-2], v.back(), l))) v.pop_back();
v.push_back(l);
}
pair<T, int> get(T x){
while(p + 1 < v.size() && v[p].f(x) < v[p+1].f(x)) p++;
return {v[p].f(x), v[p].i};
}
};
int N, K, C[101010], P[101010];
ll A[101010];
T D[101010];
pair<T, int> Check(ll c){
CHT S;
S.add({0, 0, 0});
for(int i=1; i<=N; i++){
tie(D[i],P[i]) = S.get(A[i]);
D[i] += c; C[i] = C[P[i]] + 1;
S.add({A[i]*2, D[i] - 2*A[i]*A[i], i});
// S.add({A[i], D[i] - A[i]*A[i], i});
}
return {D[N], C[N]};
}
vector<int> Track(ll c){
Check(c); vector<int> ret;
for(int i=N; i; i=P[i]) ret.push_back(i);
ret.push_back(0); reverse(ret.begin(), ret.end());
return ret;
}
// given partition p, q (p.size() >= q.size()), return k partition
// 1-based, p[0] = q[0] = 0, range : ( v[i-1], v[i] ]
vector<int> AliensTrack(int k, vector<int> p, vector<int> q){
if(p.size() == k + 1) return p; if(q.size() == k + 1) return q;
vector<int> ret;
for(int i=1, j=1; i<p.size(); i++){
while(j < q.size() && p[i-1] > q[j]) j++;
if(p[i] <= q[j] && i - j == k - (int)q.size() + 1){
ret.insert(ret.end(), p.begin(), p.begin()+i);
ret.insert(ret.end(), q.begin()+j, q.end());
return ret;
}
}
assert(false);
}
int main(){
ios_base::sync_with_stdio(false); cin.tie(nullptr);
cin >> N >> K; K++;
for(int i=1; i<=N; i++) cin >> A[i], A[i] += A[i-1];
T l = -1e18, r = 0;
while(l < r){
T m = (l + r + 1) / 2;
auto [dp,cnt] = Check(m*2+1);
if(cnt <= K) l = m; else r = m - 1;
}
auto P1 = Track(l*2+1), P2 = Track(l*2+3);
auto V = AliensTrack(K, P2, P1); assert(V.size() == K + 1);
ll R = 0;
for(int i=1; i+1<V.size(); i++) R += (A[V[i]] - A[V[i-1]]) * (A[N] - A[V[i]]);
cout << R << "\n";
for(int i=1; i+1<V.size(); i++) cout << V[i] << " ";
}
