#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
const double PI = 4 * atan(1);
#define sz(x) (int)(x).size()
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair <int, int>
#define vi vector<int>
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define vpi vector<pair<int, int>>
#define vpd vector<pair<double, double>>
#define pd pair<double, double>
#define f0r(i,a) for(int i=0;i<a;i++)
#define f1r(i,a,b) for(int i=a;i<b;i++)
#define trav(a, x) for (auto& a : x)
void fast_io(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
}
void io(string taskname){
string fin = taskname + ".in";
string fout = taskname + ".out";
const char* FIN = fin.c_str();
const char* FOUT = fout.c_str();
freopen(FIN, "r", stdin);
freopen(FOUT, "w", stdout);
fast_io();
}
const int MAXN = 1e5 + 5;
const int MAXK = 2e2 + 5;
ll dp[MAXK][MAXN];
ll pre[MAXN];
vector<ll> a;
ll get(int l, int r){return pre[r] - (l == 0? 0: pre[l-1]);}
int bef[MAXK][MAXN];
int main(){
fast_io();
int n, k;
cin >> n >> k;
k++;
f0r(i, n){
int ai;
cin >> ai;
a.eb(ai);
if(i == 0) pre[i] = ai;
else pre[i] = pre[i-1] + ai;
}
ll res = pre[n-1]*pre[n-1];
f0r(i, n){
dp[1][i] = get(0, i)*get(0, i);
bef[1][i] = -1;
}
f1r(i, 2, k+1){
f1r(j,i-1, n){
dp[i][j] = 1e18;
int best = -1;
f1r(t, i-2, j){
ll v = dp[i-1][t] + get(t+1, j)*get(t+1, j);
if(v<=dp[i][j]){
dp[i][j] = v;
best = t;
}
}
bef[i][j] = best;
}
}
f0r(i, k+1){
f0r(j, n-1){
assert(bef[i][j]<= bef[i][j+1]);
}
}
res -= dp[k][n-1];
res/=2;
// cout << dp[3][4] << endl;
cout << res << endl;
vi ans;
int f = k;
int s = n-1;
while(bef[f][s] != -1){
ans.eb(bef[f][s]);
s = bef[f][s];
f--;
}
reverse(all(ans));
for(int x: ans) cout << x+1 << " ";
cout << endl;
return 0;
}
