#include <fstream>
#define nmax 5000010
#define ios ios_base::sync_with_stdio(false);

using namespace std;

ifstream cin("deque.in");
ofstream cout("deque.out");

int n,k,i;
int a[nmax],deq[nmax];
int ft,sp;
long long sum;

int main()
{
    ios;
    cin.tie(0);
    cout.tie(0);
    cin>>n>>k;
    for (i=1;i<=n;i++){
        cin>>a[i];
    }
    ft=1;sp=0;
    for (i=1;i<=n;i++){
        while (ft <= sp && a[i] <= a[deq[sp]]) sp--;
        deq[++sp]=i;
        if (deq[ft]==i-k) ft++;
        if (i>=k) sum+=a[deq[ft]];
    }
    cout<<sum;
    return 0;
}