#include <deque>
#include <fstream>
#include <iostream>
using namespace std;

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

int n,k,i,a[5000001];
long long s=0;
deque<int>dq;
int main()
{
    f>>n>>k;
    for(i=1;i<=n;i++)
    {
        f>>a[i];
        while(!dq.empty() && dq.back()>a[i])
            dq.pop_back();
        dq.push_back(a[i]);
        if(i>k && dq.front()==a[i-k])
            dq.pop_front();
        if(i>=k)
            s+=dq.front();
    }
    g << s;
    return 0;
}