//Suleyman Atayew
#include <algorithm>
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <vector>
#include <bitset>
#include <queue>
#include <cmath>
#include <map>
#include <set>
#define N 100010
#define ff first
#define ss second
#define pb push_back
#define ll long long
#define mod 1000000007
#define pii pair <ll, ll>
#define sz(a) (ll)(a.size())
ll bigmod(ll a, ll b) { if(b==0)return 1; ll ret = bigmod(a, b/2); return ret * ret % mod * (b%2 ? a : 1) % mod; }
using namespace std;
ll n, k;
ll v[N], p[N], dp[N][5];
int pr[N][210];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k;
for(ll i = 1; i <= n; i++)
cin >> v[i], p[i] = p[i-1] + v[i];
int tp = 0;
for(ll i = 1; i <= k; i++) {
ll in = i;
for(ll h = i+1; h <= n; h++) {
while(in < h && (p[h] - p[in-1]) * p[in-1] + dp[in-1][!tp] <= (p[h] - p[in]) * p[in] + dp[in][!tp])
in++;
dp[h][tp] = (p[h] - p[in-1]) * p[in-1] + dp[in-1][!tp];
pr[h][i] = in-1;
}
tp = !tp;
}
cout << dp[n][!tp] << "\n";
ll x = n, y = k;
while(y > 0) {
cout << pr[x][y] << " ";
x = pr[x][y], y--;
}
}
/*
7 6
4 1 3 4 0 2 3
2 1
100 100
*/
