#include<iostream>
#include<vector>
#include<stack>
#include <algorithm>


long long dp[200001][2][2];
const long long inf = 1e18;

long long to(long long &x, long long y) {
	x = std::min(x, y);
}

int main(){
	int n, p;
	std::cin >> n >> p;
	
	std::vector<int> h(n);
	for (int i = 0; i < n; i++) {
		std::cin >> h[i];
	}

	std::fill_n(**dp, 200001 * 2 * 2, inf);
	dp[0][0][0] = 0;
	
	for (int i = 0; i < n; i++) {
		to(dp[i + 1][0][0], dp[i][0][0] + std::max(0, h[i + 1] - h[i]));
		if (h[i] <= h[i + 1]) {
			to(dp[i + 1][0][1], dp[i][0][0] + p);
		}
		if (h[i] >= h[i + 1]) {
			to(dp[i + 1][1][0], dp[i][0][0] + p);
		}

		to(dp[i + 1][0][0], dp[i][1][0] + std::max(0, h[i + 1] - h[i]));
		if (h[i] <= h[i + 1]) {
			to(dp[i + 1][1][0], dp[i][1][0] + 0);
		}
		if (h[i] >= h[i + 1]) {
			to(dp[i + 1][0][1], dp[i][1][0] + p);
		}

		to(dp[i + 1][0][0], dp[i][0][1] + std::max(0, h[i + 1] - h[i]));
		if (h[i] <= h[i + 1]) {
			to(dp[i + 1][1][0], dp[i][0][1] + p);
		}
		if (h[i] >= h[i + 1]) {
			to(dp[i + 1][0][1], dp[i][0][1] + 0);
		}
	}

	long long ans = std::min({dp[n][0][0], dp[n][1][0], dp[n][0][1]});
	std::cout << ans << std::endl;
}