#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
ifstream in("deque.in");
ofstream out("deque.out");
int main()
{
    deque<int>d;
    int a[100],n,s=0,k;
    in>>n>>k;
    for(int i=1; i<=n; i++)
        in>>a[i];
    for(int i=1; i<=n; i++)
    {
        if(i<k)
        {
            while(!d.empty()&& a[i]<=a[d.back()])
                d.pop_back();
            d.push_back(i);
        }
        else
        {
            while(!d.empty()&&a[i]<=a[d.back()])
                d.pop_back();
            d.push_back(i);
            if(d.front()<=i-k)
                d.pop_front();
            s+=a[d.front()];
        }

    }
    out <<s;
    return 0;
}