#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
using namespace std;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
//cout<<setprecision(20)
//cin.tie(0);
//ios::sync_with_stdio(false);
const llint mod=1000000007;
const llint big=2.19e18+1;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-15;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){return a/gcd(a,b)*b;}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
int LBI(vector<int>&ar,llint in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}
int UBI(vector<int>&ar,llint in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}
int main(void){
//愚直spit
int n,h,i,j,K;cin>>n>>K;K++;
if(n>10000){return 0;}
vector<llint>a(n);
for(i=0;i<n;i++){cin>>a[i];}
vector<vector<pair<llint,int>>>dp(K+1,vector<pair<llint,int>>(n+1,mp(big,-1)));
dp[0][0]=mp(0LL,0);
for(h=1;h<=K;h++){
for(i=1;i<=n;i++){
llint wa=0;
for(j=i-1;j>=0;j--){
wa+=a[j];
mineq(dp[h][i],mp(dp[h-1][j].fir+wa*wa,j));
}
}
}
llint gou=0;
for(i=0;i<n;i++){gou+=a[i];}
cout<<(gou*gou-dp[K][n].fir)/2<<endl;
int bas=n;
vector<int>fuku;
for(h=K;h>1;h--){
fuku.pub(dp[h][bas].sec);
bas=dp[h][bas].sec;
}
REV(fuku);
for(auto it:fuku){cout<<it<<" ";}
cout<<endl;
return 0;
}
