#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N;
    ll P;
    cin >> N >> P;
    vector<ll> H(N);
    for(int i = 0; i < N; ++i)  cin >> H[i];
    
    vector<ll> prefix(N), suffix(N);
    for(int i = 0; i + 1 < N; ++i){
        prefix[i] = min(max(0LL, H[i + 1] - H[i]), P);
        suffix[i] = min(max(0LL, H[i] - H[i + 1]), P);
    }
    for(int i = 0; i + 1 < N; ++i){
        prefix[i + 1] += prefix[i];
    }
    for(int i = N - 1; i > 0; --i){
        suffix[i - 1] += suffix[i];
    }

    ll ans = prefix[N - 1];
    for(int i = 0; i < N - 2; ++i){
        chmin(ans, prefix[i] + P + suffix[i + 1]);
    }

    cout << ans << endl;

    return 0;
}