#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define double long double;
#define pb push_back
#define endl '\n'
#define er erase
#define sz size
#define in insert
#define mp make_pair
#define fs first
#define sc second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define mod 1000000007
#define INF LONG_LONG_MAX

ll n, k, a[5000005];

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

void solve()
{
    fin>>n>>k;
    for(ll i=1;i<=n;i++)
        fin>>a[i];
    ll ans=0;
    deque<pair<ll, ll>> d;
    for(ll i=1;i<=n;i++)
    {
        while(!(d.empty()) && a[i]<=(d.back().fs))
        {
            d.pop_back();
        }
        d.push_back(mp(a[i], i));
        if((i-(d.front().sc))==k){d.pop_front();}
        if(i>=k){ans+=(d.front().fs);}
    }
    fout<<ans<<endl;
}

int32_t main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    ll tc=1;
    //cin>>tc;
    while(tc--)
    {
        solve();
    }
    return 0;
}