#include "bits/stdc++.h"
using namespace std;
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
using ll = long long;
using ld = long double;
#define pb push_back
#define ff first
#define ss second
#define sz(x) (ll)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
void freopen(string s) { freopen((s+".in").c_str(), "r", stdin); freopen((s+".out").c_str(), "w", stdout); }
void IOIGold2024_InshAllah() { ios_base::sync_with_stdio(false); cin.tie(NULL); }
ll binmul(ll a, ll b, ll c) { ll res = 0; while(b) { if(b&1) (res += a) %= c; (a += a) %= c; b >>= 1; } return res; }
ll binpow(ll a, ll b, ll c) { ll res = 1; while(b) { if(b&1) (res *= a) %= c; (a *= a) %= c; b >>= 1; } return res; }
template<typename T> T gcd(T a, T b) { if(b==0) return a; return gcd(b, a%b); }
template<typename T> T lcm(T a, T b) { return a/gcd(a, b)*b; }
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ld rnd() { return rng()%INT_MAX*1.0/INT_MAX; }
const ll inf = 1e18+7, MX = LLONG_MAX, MN = LLONG_MIN;
const ll mod = 1e9+7, N = 3e5+5;
ll a[N], p[N], pr[N];
void kigash() {
ll n, k;
cin>>n>>k;
for(ll i=1; i<=n; i++) cin>>a[i], p[i] = i, pr[i] = pr[i-1]+a[i];
vector<ll> res;
if(n<=10) {
ll mx = 0;
do {
set<pair<ll, ll>> st;
st.insert({n, 1});
ll cnt = 0, ans = 0;
vector<ll> v;
for(ll i=1; i<=n && cnt<k; i++) {
auto it = st.lower_bound({p[i], -1});
if((*it).ff==p[i]) continue;
v.pb(p[i]);
cnt++;
ans += (pr[p[i]]-pr[(*it).ss-1])*(pr[(*it).ff]-pr[p[i]]);
st.insert({p[i], (*it).ss});
st.insert({(*it).ff, p[i]+1});
st.erase(it);
}
if(ans>mx) {
mx = ans;
res = v;
}
} while(next_permutation(p+1, p+1+n));
cout<<mx<<"\n";
for(auto x: res) cout<<x<<" ";
cout<<"\n";
return;
}
return;
}
signed main(/*Kigash Amir*/) {
// freopen("");
IOIGold2024_InshAllah();
ll tt = 1;
// cin>>tt;
for(ll i=1; i<=tt; i++) {
kigash();
}
}
