#include <iostream>
#include <fstream>
#include <vector>
#include <deque>

using namespace std;

long long n,k;
vector<long long>a;
deque<long long>d;

void citire()
{
    ifstream fin("deque.in");
    fin>>n>>k;
    long long x;
    for(long long i=0;i<n;++i)
    {
        fin>>x;
        a.push_back(x);
    }
}

void fctdeque()
{
    long long suma=0;
    d.push_back(0);
    for(long long i=1;i<n;++i)
    {
        if(!d.empty())
            while(a[d.back()]>=a[i])
            {
                if(d.empty())
                    break;
                d.pop_back();
            }
        d.push_back(i);
        if(i>=k-1&&!d.empty())
        {
            if(d.back()-d.front()>=k)
                d.pop_front();
            suma+=a[d.front()];
        }
    }
    ofstream fout("deque.out");
    fout<<suma;
}

int main()
{
    citire();
    fctdeque();
    return 0;
}