#include<bits/stdc++.h>
using namespace std;
int main()
{
	freopen("friend.in","r",stdin);
	freopen("friend.out","w",stdout);
	long long n,x0,a[100005];
	cin>>n>>x0;
	if(n==1)
	{
		cout<<0;
		return 0;
	}
	for(int i=0;i<n;i++)cin>>a[i];
	sort(a,a+n);
	long long d1=(a[n-1]-a[1])+min(abs(x0-a[1]),abs(x0-a[n-1]));
	long long d2=(a[n-2]-a[0])+min(abs(x0-a[0]),abs(x0-a[n-2]));
	cout<<min(d1,d2);
	return 0;
}