#include <fstream>

using namespace std;

unsigned int N, K;
int A[5000001];

int Deque[5000001];
unsigned int Front, Back;
unsigned int i;

long long int sol;

int main ()
{
    ifstream fin ("deque.in");
    fin >> N >> K;
    for (i=1; i<=N; i++)
        fin >> A[i];
    fin.close();
    Front = 1;
    for (i=1; i<=N; i++)
    {
        while (Front<=Back && A[i]<=A[Deque[Back]])
            Back--;
        Deque[++Back] = i;
        if (Deque[Front] == i-K)
            Front++;
        if (i >= K)
            sol += A[Deque[Front]];
    }
    ofstream fout ("deque.out");
    fout << sol;
    fout.close();
    return 0;
}