#include <iostream>
#include <fstream>
#include <math.h>
#include <algorithm>
#include <deque>
#include <utility>
using namespace std;

deque <pair<int,int> > deck;
long long sum, i, nr;
int n, k;

int main(){
    //ifstream fin("date.in");
    ifstream fin("deque.in");
    ofstream fout("deque.out");

    fin >> n >> k;

    fin >> nr;
    deck.push_front(make_pair(nr, i));

    for(i = 2; i <= k; ++i){
        fin >> nr;

        if(nr <= deck.back().first){
            deck.clear();
        }
        else{
            while(nr <= deck.front().first){
                deck.pop_front();
            }
        }
        deck.push_front(make_pair(nr, i));
    }

    sum = deck.back().first;

    for(; i <= n; ++i){
        fin >> nr;

        if(nr <= deck.back().first){
            deck.clear();
        }
        else{
            while(nr <= deck.front().first){
                deck.pop_front();
            }
        }
        deck.push_front(make_pair(nr, i));

        if(deck.back().second <= i-k)
            deck.pop_back();

        sum += deck.back().first;
    }
    fout << sum ;
    return 0;
}