#include<bits/stdc++.h>
#define fo(i,d,c) for(int i=d;i<=c;i++)
#define fod(i,c,d) for(int i=c;i>=d;i--)
#define maxn 1000010
#define N 1010
#define fi first
#define se second
#define pb emplace_back
#define en cout<<"\n";
#define int long long
#define inf 1000000000
#define pii pair<int,int>
#define vii vector<pii>
#define lb(x) x&-x
#define bit(i,j) ((i>>j)&1)
#define offbit(i,j) (i^(1<<j))
#define onbit(i,j) (i|(1<<j))
#define vi vector<int>
template <typename T1, typename T2> bool minimize(T1 &a, T2 b){if (a > b) {a = b; return true;} return false;}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b){if (a < b) {a = b; return true;} return false;}
using namespace std;
int n,k;
int a[maxn];
int pre[maxn];
int sum(int l,int r)
{
return pre[r] - pre[l - 1];
}
namespace sub1
{
int solve(int l,int r,int k,vi &v)
{
if(k > r - l + 1) return 0;
if(k == 0 or l == r) return 0;
int ans = 0;
vi cc;
int pos = l,sl = 0;
fo(i,l,r - 1)
{
fo(j,0,k - 1)
{
int val = solve(l,i,j,cc) + solve(i + 1,r,k - j - 1,cc) + sum(l,i) * sum(i + 1,r);
if(ans < val)
{
ans = val;
pos = i;
sl = j;
}
}
}
v.pb(pos);
solve(l,pos,sl,v);
solve(pos + 1,r,k - sl - 1,v);
return ans;
}
}
main()
{
#define name "TASK"
if(fopen(name".inp","r"))
{
freopen(name".inp","r",stdin);
freopen(name".out","w",stdout);
}
ios_base::sync_with_stdio(false);cin.tie(NULL);
cin >> n >> k;
fo(i,1,n)
{
cin >> a[i];
pre[i] = pre[i - 1] + a[i];
}
if(n <= 50)
{
vi v;
cout << sub1::solve(1,n,k,v);en;
sort(v.begin(),v.end());
for(int it : v) cout << it << ' ';
}
}
