#include <iostream>
#include <fstream>
#include <climits>
#include <queue>

using namespace std;

fstream fin("deque.in", ios::in);
fstream fout("deque.out", ios::out);
int n,k,x;
int v[105];
int sum;
deque <int> deq;

int main()
{
    fin>>n>>k;
    int i=1,j=1,ok,d;
    while(fin>>x)
        v[i++]=x;
    for(d=1; d<=k; d++)
        deq.push_back(v[d]);
    do {
        ok=v[j];
        for(int y=1; y<=k; y++) {
            if(ok>deq.front()) ok=deq.front();
            deq.push_back(deq.front());
            deq.pop_front();
        }
        fout<<ok<<' ';
        sum+=ok;
        deq.pop_front();
        j++;
        deq.push_back(v[d++]);
    }
    while(d!=n+2);
    fout<<endl;
    fout<<sum;
    return 0;
}