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