#include <fstream>
#include <deque>

using namespace std;
deque< pair< int,int > > q;
ifstream f("deque.in");
ofstream g("deque.out");
int n,k,i,a;
long long sol;
int main()
{
    f>>n>>k;
    for(i=1;i<=n;i++)
    {
        f>>a;
        while(a<q.front().first&&q.size())
            q.pop_front();
        q.push_front(make_pair(a,i));
        if(q.back().second<=i-k)
            q.pop_back();
        if(i>=k)
            sol+=1LL*q.back().first;
    }
    g<<sol;
    return 0;
}