#include <iostream>
#include <math.h>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <cstring>
#include <iomanip>
#include <set>
#include <bitset>
#include <unordered_map>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using piii = tuple<int,int,int>;
#define f first
#define s second
#define endl '\n'
#define all(x) begin(x),end(x)
#define m_p make_pair
vector<ll> pref = {0};
int const N = 2e5+10;
int const K = 210;
ll dp[2][N];
int pos[K][N];
ll cost(int l,int r){
if(l == 0) return pref[r];
else return (pref[r]-pref[l])*pref[l];
}
void dvc(int i,int l,int r,int rl,int rr){
pll best = {0,-1};
int md = l+(r-l)/2;
for(int j{rl};j <= min(md-1,rr);j++){
best = max(best,{dp[(i+1)&1][j]+cost(j,md),j});
}
dp[i&1][md] = best.f;
pos[i][md] = best.s;
if(l == r) return;
dvc(i,l,md,rl,best.s);
dvc(i,md+1,r,best.s,rr);
}
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);
int n;cin >> n;
int k;cin >> k;
for(int i{};i < n;i++){
int g;cin >> g;
pref.emplace_back(pref.back()+g);
}
for(int i{1};i <= k;i++){
dvc(i,i+1,n,1,n);
}
cout << dp[k&1][n] << endl;
int cur = pos[k][n];
vector<int> ans;
while(cur != 0){
ans.emplace_back(cur);
cur = pos[--k][cur];
}
reverse(all(ans));
for(auto k:ans) cout << k << " ";
}
