#include <cstdio>
#include <deque>
#include <algorithm>
using namespace std;

deque<pair<int,int> >d;
int n,k;

int main(){
    int x;
    long long sum = 0;
    freopen("deque.in","r",stdin);
    freopen("deque.out","w",stdout);
        scanf("%d %d",&n,&k);
        for(int i=1;i<=k;i++)
        {
            scanf("%d",&x);
            while(d.size()>0 && d.back().second>x)d.pop_back();
            d.push_back(make_pair(i,x));
        }
            sum += d.front().second;
        for(int i=k+1;i<=n;i++)
        {
            scanf("%d",&x);
            while(d.size()>0 && d.back().second>x)d.pop_back();
            d.push_back(make_pair(i,x));
            if(d.front().first<=i-k)d.pop_front();
            sum += d.front().second;
        }

        printf("%lld\n",sum);
    return 0;
}