#include <iostream>
#include <cstdio>
#define maxn 5000002
using namespace std;

int v[maxn],q[maxn],n,k;
long long suma;

int main()
{
    freopen("deque.in","r",stdin);
    freopen("deque.out","w",stdout);
    scanf("%d%d",&n,&k);
    for (int i=1;i<=n;++i)
        scanf("%d",&v[i]);
    int fata=1,spate=0;
    for (int i=1;i<=n;++i)
    {
        while (fata<=spate && v[i]<=v[q[spate]])
            --spate;
        q[++spate]=i;
        if (i-k==q[fata]) ///daca s-a depasit subsecventa pentru indicele fata
            fata++;
        if (i>=k)
            suma+=v[q[fata]];

    }
    printf("%lld",suma);
    return 0;
}