#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

ifstream fin ("transport.in");
ofstream fout ("transport.out");

int n, k, v[16001], dr, st, mid, i, maxs, s[8001], p;

int main()
{
    fin >> n >> k;
    for (i=1; i<=n; i++) {
        fin >> v[i];
        if (v[i] > maxs)
            maxs = v[i];
    }
    cout << maxs << "\n";
    p = 1;
    for ( i=1; i <= n; i++ ) {
        if ( s[p] + v[i] > maxs ) {
            p++;
            s[p] += v[i];
        }
        else {
            s[p] += v[i];
        }
    }

    for ( i=1; i <= p; i++ ) {
        cout << s[i] << " ";
    }

    fin . close ();
    fout . close ();
    return 0;
}