#include <iostream>
#include <fstream>
using namespace std;
    ifstream f("deque.in");
    ofstream g("deque.out");
    const int z=5000001;
    int v[z];
int main()
{
    int n,k,m;
    long long s=0,i,j,x=0;
    f>>n>>k;
    for(i=1;i<=n;i++)
        f>>v[i];
    while (x<=n-k)
    {
        m=v[x+1];
            for(j=1+x;j<=k+x;j++)
            {
                if (v[j]<m)
                {
                    m=v[j];
                }

            }
        x++;
        s=s+m;

}
g<<s;
return 0;
}