#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
deque <pair<ll,int>> coada;
int main()
{   int n,k;
    f>>n>>k;
    ll sum=0;
    for(int i=1; i<=n; i++)
    {   ll x;
        f>>x;
        while(!coada.empty())
        {   int ul=coada.back().first;
            if(x<=ul) coada.pop_back();
        }
        coada.push_back({x,i});
        if(coada.front().second==i-k) coada.pop_front();
        if(i>=k) sum+=coada.front().first;
    }
    g<<sum;
    return 0;
}