#include <fstream>
#include <deque>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int n, m, i, j, k, x, ind;
long long s;
    deque <int> v;
    deque <int> poz;
int main()
{
    fin>>n>>k;
    for(i=0;i<n;i++)
        {
            fin>>x;
            if(poz.size()!=0)
            {
            while(poz.front()<=i-k&&poz.size()!=0)
            {
                v.pop_front();
                poz.pop_front();
            }
            }
            if(poz.size()!=0)
            {
            while(v.back()>=x&&poz.size()!=0)
            {
                v.pop_back();
                poz.pop_back();
            }
            }
            v.push_back(x);
            poz.push_back(i);
            if(i>=k-1)
                s+=v.front();
        }
    fout<<s<<'\n';
    return 0;
}