#include<iostream.h>
#include<fstream.h>
#define N 5000001
long a,n,k,i,j,b[N],q[N],p,u;
long long s=0;
int main()
{b[0]=p=u=0;
ifstream f1("deque.in");
ofstream f2("deque.out");
f1>>n>>k;
b[0]=0;
for(i=1;i<=n;i++)
      {f1>>a;
      while(u!=p&&a<q[u-1])
             u--;
      q[u++]=a;
      b[p]++;
      if(u-p>1)
             b[p+1]++;
      b[u-1]=1;
      if(((u-p==1&&p==i-k)||(p<i-k&&u-p<k)||(i==k&&b[p]>1))&&b[p]<k)
             s+=q[p];
      else
             if(u-p==k||b[p]==k||p==i-k||(i==k&&b[p]==1))
                   s+=q[p++];}
f2<<s;
f1.close();
f2.close();
return 0;}