#include<cstdio>
#include<iostream>
#include<algorithm>
#define RI register int
#define CI const int&
using namespace std;
const int N=5005;
int n,d,a[N],rst[N]; long long ans;
inline long long calc(CI l,CI r)
{
	static int b[N]; RI i;
	for (i=1;i<=n;++i)
	if (a[i]<l) b[i]=l; else
	if (a[i]>r) b[i]=r; else b[i]=a[i];
	long long ret=0;
	for (i=1;i<n;++i) ret+=abs(b[i]-b[i+1]);
	return ret;
}
int main()
{
	RI i,j; for (scanf("%d%d",&n,&d),i=1;i<=n;++i)
	scanf("%d",&a[i]),rst[i]=a[i];
	sort(rst+1,rst+n+1); int m=unique(rst+1,rst+n+1)-rst-1;
	for (i=j=1;i<=m;++i)
	{
		while (j<=m&&rst[j]-rst[i]<=d) ++j; --j;
		ans=max(ans,calc(rst[i],rst[j]));
	}
	return printf("%lld",ans),0;
}