#include <iostream>
#include <math.h>
#include <algorithm>
#include <set>
using namespace std;
int main()
{
long long n, a;
cin>>n>>a;
long long arr[n];
for(long long i = 0; i < n; i++)
{
cin>>arr[i];
}
sort(arr, arr + n);
if(n == 1)
{
cout<<abs(a-arr[0])<<endl;
return 0;
}
if(a <= arr[0])
{
cout<<arr[n-2] - a;
return 0;
}
if(a >= arr[n-1])
{
cout<<a-arr[1];
return 0;
}
long long c = abs(a - arr[0]) + abs(arr[n-2] - arr[0]);
long long d = abs(arr[n-1] - a) + abs(arr[n-1] - arr[1]);
if(c < d)
cout<<c<<endl;
else
cout<<d<<endl;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8bWF0aC5oPgojaW5jbHVkZSA8YWxnb3JpdGhtPgojaW5jbHVkZSA8c2V0Pgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSAKewoJbG9uZyBsb25nIG4sIGE7CgkKCWNpbj4+bj4+YTsKCQoJbG9uZyBsb25nIGFycltuXTsKCQoJZm9yKGxvbmcgbG9uZyBpID0gMDsgaSA8IG47IGkrKykKCXsKCQljaW4+PmFycltpXTsKCX0KCXNvcnQoYXJyLCBhcnIgKyBuKTsKCQoJaWYobiA9PSAxKQoJewoJCWNvdXQ8PGFicyhhLWFyclswXSk8PGVuZGw7CgkJcmV0dXJuIDA7Cgl9CglpZihhIDw9IGFyclswXSkKCXsKCQljb3V0PDxhcnJbbi0yXSAtIGE7CgkJcmV0dXJuIDA7Cgl9CglpZihhID49IGFycltuLTFdKQoJewoJCWNvdXQ8PGEtYXJyWzFdOwoJCXJldHVybiAwOwoJfQoKCWxvbmcgbG9uZyBjID0gYWJzKGEgLSBhcnJbMF0pICsgYWJzKGFycltuLTJdIC0gYXJyWzBdKTsKCWxvbmcgbG9uZyBkID0gYWJzKGFycltuLTFdIC0gYSkgKyBhYnMoYXJyW24tMV0gLSBhcnJbMV0pOwoJaWYoYyA8IGQpCgkJY291dDw8Yzw8ZW5kbDsKCWVsc2UKCQljb3V0PDxkPDxlbmRsOwoKCXJldHVybiAwOwp9