#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<map>
#define int long long
using namespace std;

bool cmp(pair<int, int>a, pair<int, int>b) {
	return a.second > b.second;
}

signed main() {
	int n = 0,d = 0;
	cin >> n >> d;
	vector<int>a(n, 0), b;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
		b.push_back(a[i]);
	}
	sort(b.begin(), b.end());
	vector<pair<int, int>>p;
	for (int i = 0; i < n; i++) {
		int l = b[i], r = l + d;
		int tmp = lower_bound(b.begin(), b.end(), r) - b.begin();
		p.push_back(make_pair(l, tmp - i));
	}
	sort(p.begin(), p.end(), cmp);
	int l = p[0].first, r = l + d;
	for (int i = 0; i < n; i++) {
		if (a[i] < l) {
			a[i] = l;
		}
		if (a[i] > r) {
			a[i] = r;
		}
	}
	int ans = 0;
	for (int i = 0; i < n - 1; i++) {
		ans += abs(a[i] - a[i + 1]);
	}
	cout << ans << endl;
	return 0;
}