#include <iostream>
#include <fstream>
using namespace std;


int main()
{ ifstream fin("deque.in");
ofstream fout("deque.out");
int n,k,i,p=0,u=-1;
long long suma=0;
fin>>n>>k;
k--;
int v[n],poz[n];
for(i=0;i<n;i++)
{fin>>v[i];
if(poz[p]==poz[u]-k)
    {suma+=v[poz[p]];
        p++;
    }
while(p<=u && v[i]<v[poz[u]])
    u--;
u++;
poz[u]=i;}
suma+=v[poz[p]];
fout<<suma;


	return 0;
}