/*
██████╗ █████╗ ███████╗██╗ ██╗██╗██████╗
██╔══██╗██╔══██╗██╔════╝██║ ██║██║██╔══██╗
██████╔╝███████║███████╗███████║██║██║ ██║
██╔══██╗██╔══██║╚════██║██╔══██║██║██║ ██║
██║ ██║██║ ██║███████║██║ ██║██║██████╔╝
╚═╝ ╚═╝╚═╝ ╚═╝╚══════╝╚═╝ ╚═╝╚═╝╚═════╝
*/
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define ull unsigned long long
#define ld long double
#define str string
#define ch char
#define db double
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define YES cout<<"YES\n";
#define NO cout<<"NO\n";
#define Bob cout<<"Bob\n";
#define Alice cout<<"Alice\n";
#define ordered_set tree<pair<ll, ll>, null_type,less<pair<ll,ll>>,rb_tree_tag,tree_order_statistics_node_update>
const ll MOD=1e9+7;
const ll INF = 10000000000;
void solve(){
ll n,d;
cin>>n>>d;
vector<ll>a(n+1);
for(ll i = 1;i<=n;i++)cin>>a[i];
if(n==2){
cout<<a[2];
return;
}
bool ok = true;
for(int i = 1;i<=n;i++){
if(a[i]!=0){
ok=false;
break;
}
}
if(ok){
cout<<0;
return;
}
bool flag = true;
ll alma = a[1];
for(int i = 1;i<n;i++){
if(a[i]!=a[i+1]){
flag=false;
break;
}
}
if(flag){
cout<<(n-1)*alma;
return;
}
vector<ll>mx(n+1);
mx[n]=a[n];
for(ll i = n-1;i>=1;i--){
mx[i]=max(a[i],mx[i+1]);
}
ll ans = 0;
for(ll i = 1;i<n;i++){
ans+=mx[i+1];
}
cout<<ans;
}
signed main(){
ll t=1;
//cin>>t;
while(t--){
solve();
}
return 0;
}
