#include <fstream>
#include <deque>
#include <stdio.h>
using namespace std;
ifstream fi("deque.in");
ofstream fo("deque.out");
int n,k,i;
int A[5000001];
long long sum;
deque <int> D;
int main()
{
    FILE *fi;
    fi=fopen("deque.in","r");
    fscanf(fi,"%d",&n);
    fscanf(fi,"%d",&k);
    for(i=1;i<=n;i++)
    {
        fscanf(fi,"%d",&A[i]);
        while(!D.empty() and A[i]<D.back())
            D.pop_back();
        D.push_back(A[i]);
        if(i>=k and D.front()==A[i-k])
            D.pop_front();
        if(i>=k)
            sum+=D.front();
    }
    fo<<sum;
    fo.close();
    return 0;
}