#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18
#define f first
#define s second
mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
void Solve()
{
int n, k; cin >> n >> k;
vector <int> a(n + 1);
int sum = 0;
for (int i = 1; i <= n; i++){
cin >> a[i];
sum += a[i];
a[i] += a[i - 1];
}
k++;
vector<vector<int>> dp(n + 1, vector<int>(k + 1, INF));
vector<vector<int>> par(n + 1, vector<int>(k + 1, -1));
dp[0][0] = 0;
for (int i = 1; i <= n; i++){
for (int j = 1; j <= k; j++){
for (int i1 = 0; i1 < i; i1++){
int val = dp[i1][j - 1] + (a[i] - a[i1]) * (a[i] - a[i1]);
if (val < dp[i][j]){
dp[i][j] = val;
par[i][j] = i1;
}
}
}
}
int ans = (sum * sum) - (dp[n][k]);
ans /= 2;
cout << ans << "\n";
vector <int> go;
int i = n;
while (par[i][k] != 0){
i = par[i][k];
k--;
go.push_back(i);
}
reverse(go.begin(), go.end());
for (auto x : go) cout << x << " ";
cout << "\n";
}
int32_t main()
{
auto begin = std::chrono::high_resolution_clock::now();
ios_base::sync_with_stdio(0);
cin.tie(0);
int t = 1;
// cin >> t;
for(int i = 1; i <= t; i++)
{
//cout << "Case #" << i << ": ";
Solve();
}
auto end = std::chrono::high_resolution_clock::now();
auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n";
return 0;
}
