#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 5003 * 3, m = 5000;
const ll INF = 1000000009000000009;
int n, h;
int a[N];
ll dp[N][N];
ll t[N * 4];
void bil(int tl, int tr, ll a[], int pos)
{
if (tl == tr)
{
t[pos] = a[tl];
return;
}
int m = (tl + tr) / 2;
bil(tl, m, a, pos * 2);
bil(m + 1, tr, a, pos * 2 + 1);
t[pos] = min(t[pos * 2], t[pos * 2 + 1]);
}
ll qry(int tl, int tr, int l, int r, int pos)
{
if (l > r)
return INF;
if (tl == l && tr == r)
return t[pos];
int m = (tl + tr) / 2;
return min(qry(tl, m, l, min(m, r), pos * 2),
qry(m + 1, tr, max(m + 1, l), r, pos * 2 + 1));
}
void solv()
{
scanf("%d%d", &n, &h);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
vector<int> v;
for (int i = 1; i <= n; ++i)
{
v.push_back(max(0, a[i] - h));
v.push_back(a[i]);
v.push_back(a[i] + h);
}
sort(all(v));
for (int j = 0; j < sz(v); ++j)
{
dp[1][j] = abs(a[1] - v[j]);
}
for (int i = 2; i <= n; ++i)
{
bil(0, sz(v) - 1, dp[i - 1], 1);
for (int j = 0; j < sz(v); ++j)
{
int l = lower_bound(all(v), v[j] - h) - v.begin();
int r = upper_bound(all(v), v[j] + h) - v.begin() - 1;
dp[i][j] = abs(a[i] - v[j]) + qry(0, sz(v) - 1, l, r, 1);
}
}
ll ans = INF;
for (int j = 0; j < sz(v); ++j)
ans = min(ans, dp[n][j]);
printf("%lld\n", ans);
}
int main()
{
#ifdef SOMETHING
freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
#endif // SOMETHING
//ios_base::sync_with_stdio(false), cin.tie(0);
solv();
return 0;
}
//while ((double)clock() / CLOCKS_PER_SEC <= 0.9){}
