#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
/*typedef __uint128_t L;
struct FastMod {
ull b, m;
FastMod(ull b) : b(b), m(ull((L(1) << 64) / b)) {}
ull reduce(ull a) {
ull q = (ull)((L(m) * a) >> 64);
ull r = a - q * b; // can be proven that 0 <= r < 2*b
return r >= b ? r - b : r;
}
};
FastMod FM(2);*/
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << H;
debug_out(T...);
}
#define debug(...) cerr << "(" << #__VA_ARGS__ << "):", debug_out(__VA_ARGS__)
#define all(x) x.begin(), x.end()
#define MP(x, y) make_pair(x, y)
#define F first
#define S second
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxn = 1e5 + 10;
const int maxk = 200 + 10;
int n, k, a[maxn], flg[maxk][maxn];
ll dp[maxk][maxn];
int main(){
ios_base::sync_with_stdio(false); cin.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; i++) cin >> a[i];
int sum = 0;
ll ans = 0;
for (int i = 1; i <= n; i++){
ans += 1ll * sum * a[i];
dp[0][i] = ans;
sum += a[i];
}
for (int i = 1; i <= k; i++){
for (int j = 1; j <= n; j++){
int sum = a[j];
ll val = 0;
flg[i][j] = j-1;
dp[i][j] = dp[i-1][j-1];
for (int k = j-1; ~k; k--){
ll tmp = dp[i-1][k] + val;
if (tmp < dp[i][j]){
dp[i][j] = tmp;
flg[i][j] = k;
}
val += 1ll * sum * a[k];
sum += a[k];
}
}
}
cout << ans - dp[k][n] << '\n';
int ptr = n;
int tmp = k;
while(tmp){
cout << flg[tmp][ptr] << ' ';
ptr = flg[tmp][ptr];
tmp--;
}
cout << '\n';
return 0;
}
