#include <iostream>
#include <deque>
#include <fstream>

using namespace std;

ifstream f("deque.in");
ofstream g("deque.out");

deque <int> mydeque;

int main()
{   int i, v[5000004], n, k, s = 0, j;

    f>>n>>k;

    for(i = 1; i <= n; i++)

        f>>v[i];

    mydeque.clear();

    mydeque.push_back(v[1]);

    for(i = 2; i <= k; i++){

        for(j = 1; j <= mydeque.size(); j++)

            if(v[i] < mydeque[j])

                break;

        mydeque.erase(mydeque.begin() + j, mydeque.begin() + mydeque.size());

        mydeque.push_back(v[i]);
    }

    s += mydeque.front();
    g<< mydeque.front()<<" ";

    for(i = k + 1; i <= n; i++){

        mydeque.pop_front();

        for(j = 1; j <= mydeque.size(); j++)

            if(v[i] < mydeque[j])

                break;

        mydeque.erase(mydeque.begin() + j, mydeque.begin() + mydeque.size());

        mydeque.push_back(v[i]);

        g<< mydeque.front()<<" ";

        s += mydeque.front();

    }


    g << '\n';

    g << s;



    return 0;
}