#include<fstream>
using namespace std;
ifstream F("deque.in");
ofstream G("deque.out");
#define N 5000001
int v[N],d[N],p=1,u,i,n,k;
long long s;
int main()
{
    F>>n>>k;
    for(i=1;i<=n;++i)
        F>>v[i];
    for(i=1;i<k;++i) {
        for(;p<=u&&v[i]<=v[d[u]];--u);
        d[++u]=i;
    }
    for(i=k;i<=n;++i) {
        for(;p<=u&&v[i]<=v[d[u]];--u);
        d[++u]=i;
        if(d[p]==i-k)
            ++p;
        s+=v[d[p]];
    }
    G<<s;
    return 0;
}