#include <bits/stdc++.h>
#define Dim 5000009
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
typedef long long ll;
typedef pair< ll,int > pi;
ll N,K,sum,a;

deque < pi > dq;

int main()
{
    f>>N>>K;
    for(int i=1;i<=N;i++)
    {
        f>>a;
        if(dq.front().second+K-1<i) dq.pop_front();
        while(!dq.empty()&&a<=dq.back().first) dq.pop_back();
        dq.push_back({a,i});
        if(i>=K) sum+=dq.front().first;
    }
    g<<sum;
    return 0;
}