#include <fstream>
#include <deque>
using namespace std;
ifstream cin ("deque.in");
ofstream cout ("deque.out");
deque <int> v;
int x[10005];
int main()
{
    int n,i,j,k,minim,a,suma=0;
    cin>>n>>k;
    for(i=1;i<k;i++)
    {
        cin>>x[i];
        minim=min(minim,x[i]);
    }
    v.push_back(minim);
    for(i=k;i<=n;i++)
    {
        cin>>x[i];
        while(v.size()>=1 && v.back()>x[i])
        {
            v.pop_back();
        }
        v.push_back(x[i]);
        a=v.front();
        if(x[i-k]==v.front())
        {
            v.pop_front();
        }
        suma=suma+v.front();
    }
    cout<<suma;
    return 0;
}