#include <iostream>
#include <fstream>
    long nmax=5000000;
using namespace std;

int main()
{
    ifstream f1("deque.in");
    ofstream f2("deque.out");
    long long x[nmax];
    long long i,j,n,s, suma, minim;
    f1>>n>>s;
    i=0;
    while (f1>>x[i])
        i++;
    suma=0;
    for (i=0; i<=n-s; i++)
    {
        minim=x[i];
        for (j=0;j<s;j++)
        {
            if (minim>x[i+j])
                minim=x[i+j];
        }
        suma+=minim;
    }
    f2<<suma;
    return 0;
}