#include <fstream>
#include <deque>
using namespace std;
ifstream f1("deque.in");
ofstream f2("deque.out");
int n, k;
deque< pair<int, int> > dek;
long long s;
int main() 
{
        int x;
	f1 >> n >> k;
	for (int i = 0; i < n; ++i) {
		f1>>x;
		while (!dek.empty() && dek.back().first > x)
			dek.pop_back();
		dek.push_back(make_pair(x, i));
		if (dek.front().second + k == i)
			dek.pop_front();
		if (i+1>=k)
		s += dek.front().first;
	}
	f2 << s;
}