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

using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
deque <int> dq;
int v[5000009];
int main ()
{
    int n, k;
    f >> n >> k;
    for (int i=1; i<=n; i++)
        f >> v[i];
    long long s=0;
    for (int i=1; i<=n; i++)
    {
        while (!dq.empty() && i-dq.front()>=k) dq.pop_front();
        while (!dq.empty() && v[i]<v[dq.back()]) dq.pop_back();
        dq.push_back(i);
        if (i>=k)
        {
            s+=v[dq.front()];
        cout << v[dq.front()] << ' ';
        }
    }
    g << s;

}