#pragma GCC optimize "-O3"
#pragma GCC optimize("Ofast")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define NumberOfOnes __builtin_popcount
#define LSOne(S) (S & (-S))
#define ll long long
#define two pair<ll,ll>
#define twoll pair<ll,ll>
#define four pair<two,two>
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define y1 y1922
#define INF 1000000000000000000
#define P 1000000007
#define lmax 1000000000
#define nn 1000003
#define ff first.first
#define fs first.second
#define sf second.first
#define ss second.second
#define f first
#define s second
#define vi vector<ll>
#define vll vector<ll>
#define vtwo vector<two>
#define ALL(container) (container).begin(), (container).end()
#define sz(container) (ll)(container.size())
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define mid(a,b) (a+b>>1)
#define minN 0
#define maxN 10000000
#define na(x) ((x)<P?(x):(x)-P)
#define ab(a) (-(a)<(a)?(a):-(a))
#define FAST std::ios::sync_with_stdio(false)
#define xRand mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define rnd rng
#define IT iterator
typedef
tree<
ll,// aq pair<ll,ll> shegidzlia
null_type,
less/*_equal*/<ll>,// aqac
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
// '_equal' mashin ginda roca multiset gchirdeba
template<class key, class value,class cmp = std::less<key>>
using ordered_map = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;
ordered_map<ll, ll> my_map;
inline ll rin(){
ll x=0,w=1;char ch=getchar();
while ((ch<'0'||ch>'9')&&ch!='-') ch=getchar();
if (ch=='-') w=0,ch=getchar();
while (ch>='0'&&ch<='9') x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
return w?x:-x;
}
inline ll bin(){
ll x=0;char ch=getchar();
while (ch<'0'||ch>'9') ch=getchar();
while (ch>='0'&&ch<='9') x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
return x;
}
ll n,k,ans,a[100004],p[10004][204];
ll dp[100004][205],sm[100004],ind,x;
vector<ll>v;
int main(){FAST;xRand;
cin>>n>>k;
for(ll i=1;i<=n;i++){
cin>>a[i];
sm[i]=sm[i-1]+a[i];
dp[i][0]=sm[i];
}
for(ll i=1;i<=n;i++){
for(ll j=1;j<=k;j++){
for(ll o=0;o<i;o++){
x=(sm[i]-sm[o])*(sm[n]-sm[i])+
dp[o][j-1];
if(x>dp[i][j]){
dp[i][j]=x;
p[i][j]=o;
}
}
}
}
for(ll i=1;i<n;i++){
if(ans<=dp[i][k]){
ans=dp[i][k];
ind=i;
}
}
if(ans==0){
cout<<ans<<endl;
for(int i=1;i<=k;i++){
cout<<i<<" ";
}
return 0;
}
v.pb(ind);
cout<<ans<<endl;
while(k>0&&p[ind][k]!=0){
// cout<<p[ind][k]<<" ";
v.pb(p[ind][k]);
ind=p[ind][k];
k--;
}
reverse(ALL(v));
if(k!=sz(v)){
while(true) k++;
}
for(ll i=0;i<sz(v);i++){
if(n<v[i]) cout<<7/0<<endl;
cout<<v[i]<<" ";
}
// you should actually read the stuff at the bottom
}
/*
7 3
4 1 3 4 0 2 3
*/
/* stuff you should look for
* ll overflow, array bounds
* special cases (n=1?), slow multiset operations
* do smth instead of nothing and stay organized
* unordered_map, hash_map, scanf, calculate answer instead of ans*K
*/
/*
* *
* * * *
* * * *
* * * *
* * * * *
* * * *
* * * *
* * *
* *
*/
