#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int A[5000010],N,K,j,Min,i,p,u,d[5000010];
long long s;
int main()
{
    fin>>N>>K;
    for(i=1;i<=N;i++) fin>>A[i];
    p=u=d[1]=1;
    for(i=2;i<=N;i++)
    {
        while(A[i]<A[d[u]]&&p<=u) --u;
        d[++u]=i;
        if(i-d[p]==K) p++;
        if(i>=K) s+=A[d[p]];
    }
    fout<<s;
}