#include <bits/stdc++.h>
#define int long long
#define N 10005
#define K 220
#define f first
#define s second
#define inf 2000000000
using namespace std;
typedef pair<int, int> pii;
int n, k, v[N], dp[N][K], sum[N], prox[N][K];
void print(int ini, int k)
{
if(!prox[ini][k]) return;
cout<<prox[ini][k]<<" ";
print(prox[ini][k] + 1, k - 1);
}
int32_t main()
{
ios::sync_with_stdio(false); cin.tie(0);
cin>>n>>k;
for(int i = 1; i <= n; i++) cin>>v[i], sum[i] = sum[i - 1] + v[i];
memset(dp, -1, sizeof dp);
for(int q = 0; q <= k ; q++)
{
for(int i = n; i >= 1; i--)
{
for(int j = i; j < n; j++)
{
int custo = (sum[j] - sum[i - 1])*( sum[n] - sum[j] );
int filhos = dp[j + 1][q - 1];
if( filhos + custo > dp[i][q] )
{
dp[i][q] = filhos + custo;
prox[i][q] = j;
}
}
}
}
cout<<dp[1][k]<<"\n";
print(1, k);
cout<<"\n";
}
