#include <iostream>
#include <deque>
#include <fstream>
using namespace std;
deque< pair<int, int> > d;
long long answer=0;
int n, k;
int main()
{
    ifstream f("deque.in");
    ofstream g("deque.out");
    int i, x;
    f>>n>>k;
    for (i=1;i<=k;i++)
    {
    f>>x;
    while (!d.empty() && d.back().first>x) d.pop_back();
    d.push_back(make_pair(x, i));
    }
    answer+=d.front().first;
    d.pop_front();
    for (i=k+1;i<=n;i++)
    {
        f>>x;
        while (!d.empty() && d.back().first>x)  d.pop_back();
        d.push_back(make_pair(x, i));
        if (!d.empty() && d.front().second<=i-k) d.pop_front();
        answer+=d.front().first;
    }
    g<<answer<<'\n';
}