#include<iostream>
#include<fstream>
#include<deque>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
deque<int> q;
int n,k;
int v[50000001];
void Citire()
{
    f>>n>>k;
}
void Solve()
{
    for(int i=1;i<=n;i++)
        f>>v[i];
    int suma=0;
    for(int i=1;i<=n;i++)
    {
        if(!q.empty())
            while(v[q.back()]>=v[i] && !q.empty())
                q.pop_back();
        q.push_back(i);
        if(q.back()-q.front()>=k)
            q.pop_front();
        if(i>2)
        {
            if(!q.empty())
                suma=suma+v[q.front()];
        }
    }
    g<<suma;
}
int main()
{
    Citire();
    Solve();
}