#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 ans = 0;
	for (int k = 0; k < n && p[k].second == p[0].second; k++) {
		int l = p[k].first, r = l + d;
		vector<int>c = a;
		for (int i = 0; i < n; i++) {
			if (c[i] < l) {
				c[i] = l;
			}
			if (c[i] > r) {
				c[i] = r;
			}
		}
		int res = 0;
		for (int i = 0; i < n - 1; i++) {
			res += abs(c[i] - c[i + 1]);
		}
		ans = max(ans, res);
	}
	cout << ans << endl;
	return 0;
}