#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()

typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef vector<VI> VVI;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;

int main() {
    int n;
    ll p;
    cin >> n >> p;
    VL h(n);
    REP(i,n) scanf("%lld", &h[i]);

    VL r(n);
    REP(i,n-1){
        r[i+1] = r[i] + min(p, max(0LL, h[i+1] - h[i]));
    }
    VL l(n);
    FORR(i,n-2,0){
        l[i] = l[i+1] + min(p, max(0LL, h[i] - h[i+1]));
    }

    REP(i,n-1){
        r[i+1] = min(r[i+1], r[i] + min(p, max(0LL, h[i+1] - h[i])));
        FOR(j,i+1,n-2){
            r[j+1] = min(r[j+1], r[i] + l[i+1] - l[j] + 2*p);
        }
        r[n-1] = min(r[n-1], r[i] + l[i+1] - l[n-1] + p);
    }

    cout << r[n-1] << endl;

    return 0;
}