#include <fstream>
#include <deque>

using namespace std;

ifstream cin("deque.in");
ofstream cout("deque.out");

deque < long long > d;
int poz=1;
int main()
{
    long long n,k,x,i,sum=0;
    cin>>n>>k;
    for(i=1; i<=n; i++)
    {
        cin>>x;
        while(x<=d.front()&&d.size()>0)
        {
            d.pop_front();
        }
        d.push_front(x);
        if(d.size()==1)
            poz=i;
        if(i>=k)
            sum=sum+d.back();
        if(poz==i-k+1)
        {
            d.pop_back();
        }
    }
    cout<<sum;
    return 0;
}