#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
deque <int>q;
long long n,i,s,k,z,j,x,v[5000001],minim;
int main()
{
    f>>n>>k;
    i=1;
    x=0;
    while(i<=n)
    {
        f>>z;
        if(x<k)
        {
            q.push_back(z);
            x++;
            v[x]=z;
        }
        else
        {
            minim=10000001;
            for(j=1;j<=k;j++)
            {
                if(v[j]<minim) minim=v[j];
            }
            s=s+minim;
            cout<<minim<<" ";
            q.pop_front();
            for(j=2;j<=k;j++)
            {
                v[j-1]=v[j];
            }
            x--;
            q.push_back(z);
            x++;
            v[x]=z;
        }
        i++;
    }
    minim=10000001;
    for(j=1;j<=k;j++)
    {
        if(v[j]<minim) minim=v[j];
    }
    s=s+minim;
    g<<s;
    return 0;
}