#include<iostream>
#include<algorithm>
#include<math.h>
#include<string>
#include<string.h>
#include<queue>
#include<deque>
#include<vector>
#include<map>
#include<set>
#pragma GCC optimize(3,"Ofast","inline")
#define endl "\n"
using namespace std;
typedef long long ll;
ll n,m,a[5200],u=0;
ll check(ll x)
{
	ll ans=0,d=0,f=0,os=0;
	ll o=x+m;
	for(ll i=1;i<=n;i++)
	{
	if(a[i]>=x&&a[i]<=o)
	ans++;	
	if(a[i]<=x)
	d++;
	if(a[i]>=o)
	f++;
	if(i>=2)
	{
		ll z;
	if(a[i]<=x)
	z=x;
	else if(a[i]>=o)
	z=o;
	else z=a[i];
	ll r;
	if(a[i-1]<=x)
	r=x;
	else if(a[i-1]>=o)
	r=o;
	else r=a[i-1];
	os+=abs(r-z);
   }
	} 
	u=max(u,os);
	if(f>d)
	return 0;
	else
	return 1;
}
int main()
{
	cin>>n>>m;
for(ll i=1;i<=n;i++) cin>>a[i];
ll l=-1e9,r=1e9;
ll mid;
while(l<r)
{	
	mid=l+(r-l)/2;
	if(check(mid))
	{
		r=mid;
	}
	else
	l=mid+1;
}
cout<<u<<endl;
}