#include <fstream>
using namespace std;

ifstream cit("deque.in");
ofstream afis("deque.out");

int N, K;
long long sum = 0;

int main()
{
    cit>>N>>K;
    int deque[N], poz[N];
    int back = -1, front = 0;
    for(int i=0; i<N; i++)
    {
        cit>>deque[i];
        while((front<=back) && (deque[i]<=deque[back]))
            back--;
        deque[++back] = deque[i];
        poz[back] = i;
        if(poz[front] == i-K)
            front++;
        if(i+1 >= K)
            sum += deque[front];
    }
    afis<<sum;
    return 0;
}