#include <bits/stdc++.h>

using namespace std;
ifstream in ("deque.in");
ofstream out ("deque.out");

queue <int> dqIg;

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

    for(int i = 0; i < n; i++){
        int crt;
        in >> crt;
        dqIg.push(crt);
    }

    long long suma = 0;
    int prev2x = dqIg.front();
    dqIg.pop();
    int prev1x = dqIg.front();
    dqIg.pop();
    int crt;

    while(!dqIg.empty()){
        crt = dqIg.front();
        dqIg.pop();
        int minimum = min(prev1x, min(prev2x, crt));
        suma += minimum;
        prev2x = prev1x;
        prev1x = crt;
    }
    out << suma;
    return 0;
}