#include <bits/stdc++.h>

using namespace std;
ifstream f ("deque.in");
ofstream g ("deque.out");
deque< pair <int, int> > dq;
int main()
{
    int n,k,s=0;
    f>>n>>k;
    int el;
    for(int i=1;i<k;++i){
        f>>el;
        while(!dq.empty() && el<=dq.back().first){
            dq.po
            p_back();
        }
        dq.push_back(make_pair(el, i));
    }
    for(int i=k;i<=n;++i){
        f>>el;
        while(!dq.empty() && el<=dq.back().first){
            dq.pop_back();
        }
        dq.push_back(make_pair(el, i));
        while(!dq.empty() && i-k>=dq.front().second){
            dq.pop_front();
        }
        s+=dq.front().first;
        cout<<dq.front().first<<" ";
    }
    g<<s;
    return 0;
}