#include <bits/stdc++.h>

using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
long long n,k,v[100005],i,s;
deque<int> dq;
int main()
{
    f>>n>>k;
    for(i=1;i<=n;i++)f>>v[i];
    dq.push_front(1);
    for(i=1;i<=n;i++){
    while(!dq.empty() && v[dq.back()]>=v[i]){
    dq.pop_back();
    }
    dq.push_back(i);
    if(i>=k){
        while(!dq.empty() && i-dq.front()>=k)
         dq.pop_front();
         s+=v[dq.front()];
    }
    }
    g<<s;
    return 0;
}