#include <bits/stdc++.h>

using namespace std;

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

int n, k, s;
int arr[5000005];
deque< int > v;

int main()
{
    in>>n>>k;
    for( int i = 1; i <= n; i++ )
        in>>arr[i];

    for( int i = 1; i <= n; i++ )
    {
        while( !v.empty() && arr[ v.back() ] == arr[i] )
            v.pop_back();

        if( v.front() <= i - k )
            v.pop_front();

        if( i >= k )
            s += arr[ v.front() ];
    }

    out<<s;

    return 0;
}