#include <iostream>
#include <fstream>
#include <cmath>

using namespace std;

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

const int dim = 5000005;

int n,m,a[dim],rmq[20][dim],lg[dim];

int rezolva(int x,int y)
{
    int dif = y-x+1;
    int log2 = lg[dif];
    return min(rmq[log2][x] , rmq[log2][y - (1<<log2) + 1]);
}

int main()
{
    in >> n >> m;
    for (int i=1; i<=n; i++)
    {
        in >> a[i];
        rmq[0][i] = a[i];
    }
    for (int j=1;  (1<<j) <= n; j++)
    {
        for (int i=1; i + (1<<j) - 1 <=n; i++)
        {
            rmq[j][i] = min(rmq[j-1][i] , rmq[j-1][ i + (1<<(j-1))]);
        }
    }
    lg[1] = 0;
    for (int i=2; i<=n; i++)
    {
		lg[i] = lg[i/2] + 1;
    }
    long long int s = 0;
    for (int i=1; i+m-1<=n; i++)
    {
        s += rezolva(i,i+m-1);
    }
    out << s;
    return 0;
}