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

int first,last,que[5000001],a[5000001],n,k,i;
long long sum;
int main()
{
    ifstream f("deque.in");
    ofstream g("deque.out");
    f>>n>>k;
    for (i=1;i<=n;i++)
        f>>a[i];
    first=1;
    last=0;
    for (i=1;i<=n;i++)
    {
           while ((first <= last) && (a[i]<= a[ que [last] ])) last--;
           que [++last]=i;
           if (que[first]==i-k) first++;
           if (i>=k) sum+=a[que[first]];
    }
    g<<sum;
    return 0;
}