#include <bits/stdc++.h>

using namespace std;

deque <int> d;

int n, x, k, nr, s, h;

ifstream f("deque.in");
ofstream g("deque.out");

int main()
{
    f >> n >> k;
    for(int i=1; i<=n; i++)
    {
        f >> x;
        if(i>=k)s+=d.back();
        if(nr==k) nr=0, d.pop_back();
        else
        {
            if(!d.empty())
            {
                while(d.front()>=x) {
                        d.pop_front();
                        h=d.front();
                }
            }
            nr++;
        }
        d.push_front(x);
        h=d.front();
    }
    g << s;
}