#include <fstream>

using namespace std;

ifstream fin("deque.in");
ofstream fout("deque.out");

long long s;
int n,k,st,dr,i,a[5000005],d[5000005];

int main()
{
    fin >> n >> k;
    for (i=1;i<=n;i++) fin >> a[i];
    d[1]=1;
    st=dr=1;
    for (i=2;i<=n;i++)
    {
        while (st<=dr && a[i]<=a[d[dr]]) dr--;
        dr++;
        d[dr]=i;
        if (i-k==d[st]) st++;
        if (i>=k) s+=a[d[st]];
    }
    fout << s;

    return 0;
}