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

using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int n,k,a;
long long s;
int minim=10000001;
deque <int> d;
int main()
{
    fin>>n>>k;
    for(int i=1; i<=k; i++)
    {
        fin>>a;
        d.push_back(a);
    }
    for(int j=0; j<k; j++)
    {
        if(d[j]<=minim)minim=d[j];



    }
    s+=minim;


    cout<<s<<"  ";
    for(int i=k; i<=n; i++)
    {
        fin>>a;
        d.push_back(a);


        if(minim<=d.back())
        {
            s+=minim;
            cout<<minim<<" if1 ";
            if(minim==d.front())
            {
                d.pop_front();
                minim=d[0];
            }
            else d.pop_front();
        }

        else //if(minim==d.front())
        {
            s+=minim;
            d.pop_front();
            minim=d[0];
            for(int j=0; j<k; j++)
            {
                if(d[j]<minim)
                {
                    minim=d[j];

                }
            }


            cout<<minim<<" if2 ";
        }



    }
    fout<<s;


    return 0;
}