#include <iostream>
#include <fstream>
using namespace std;
ifstream in("deque.in");
ofstream out("deque.out");
long long d[10000001];
long long p[10000001];
int main()
{
    long long k,n;
    long long s=0;
    long long pi=1,ps=0;
    long long mnsecv=100000000;
    int pp=1;
    in>>n>>k;
    for(long long i=1;i<=n;i++)
    {
        long long x;
        in>>x;
        ps++;
        d[ps]=x;
        mnsecv=d[pi];
        if(ps-pi>k)
        {
            p[pp]=mnsecv;
            pp++;
            pi++;
            out<<p[pp-1]<<"\n";
        }
        while(d[ps]<=d[ps-1] && ps>pi+1)
        {
            int aux=d[ps-1];
            d[ps-1]=d[ps];
            d[ps-2]=aux;
            ps--;
        }
    }
    for(int i=1;i<=n;i++)
        s=s+p[i];
    out<<s;
    return 0;
}