#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return 63 - __builtin_clzll(mask);}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
for(auto item: container) out << item << separator;
out << finish;
}
template <class T>
void remove_dup(vector<T> &a){
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
const int N = 1e5 + 69, K = 201;
const int INF = 1e9 + 69;
int a[N], pref[N];
int dp[K][N];
int main(void){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, k; cin >> n >> k;
for(int i = 1; i<=n; ++i) cin >> a[i];
for(int i = 1; i<=n; ++i) pref[i] = pref[i-1] + a[i];
for(int layer= 0; layer <= k; ++layer)
for(int i = 0; i<=n; ++i) dp[layer][i] = -INF;
dp[0][0] = 0;
for(int layer = 1; layer <= k+1; ++layer){
for(int i = layer; i<=n; ++i) {
for(int j = i; j>=layer; --j) {
int s1 = pref[i] - pref[j-1], s2 = pref[j-1];
maximize(dp[layer][i], dp[layer - 1][j-1] + s1 * s2);
}
}
}
cout << dp[k+1][n] << "\n";
int i = n;
for(int layer = k + 1; layer >= 2; --layer){
for(int j = i; ; --j){
int s1 = pref[i] - pref[j-1], s2 = pref[j-1];
if (dp[layer][i] == dp[layer-1][j-1] + s1 * s2){
cout << j - 1 << " ";
i = j - 1;
break;
}
}
}
cout << "\n";
return 0;
}
