#define __USE_FILES__
#ifdef __USE_FILES__
#include <fstream>
std::ifstream in("deque.in");
std::ofstream out("deque.out");
#else
#include <iostream>
std::istream& in = std::cin;
std::ostream& out = std::cout;
#endif

// directive preprocesate
#include <algorithm>
#include <array>
#include <cassert>
#include <deque>
#include <functional>
#include <limits>
#include <math.h>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;

struct numar {
    int32_t val;
    uint32_t index;

    numar(int32_t v = 0, uint32_t i = 0)
    {
        val = v;
        index = i;
    }
};

// declaratie functii
void addToQue(std::deque<numar>& qq, numar el)
{
    // this is a special add operation
    while (!qq.empty() && qq.back().val > el.val) {
        qq.pop_back();
    }
    qq.push_back(el);
}

void printQue(std::deque<numar>& qq)
{
    for (auto&& x : qq)
        out << x.val << " ";
    out << "\n";
    return;
}

// declaratii variablile
uint32_t n, k;
int64_t sum;
std::deque<numar> q;

int main()
{
    in >> n >> k;

    for (uint32_t i = 1; i <= k; ++i) {
        int32_t v;
        in >> v;
        addToQue(q, { v, i });
        // printQue(q);
    }
    sum = q.front().val;

    for (uint32_t i = k + 1; i <= n; ++i) {
        int32_t v;
        in >> v;
        addToQue(q, { v, i });
        while (!q.empty() && i - q.front().index >= k) {
            q.pop_front();
        }
        // printQue(q);
        sum += q.front().val; // q.front() este minimul intervalului curent
    }

    out << sum;

    return 0;
}