#include <bits/stdc++.h>
using namespace std;
int a[100010];
int main() {
  int i, j, k, n, b, Min = INT_MAX;
  cin >> n >> b;
  for (i = 1; i <= n; i++) {
    cin >> a[i];
  }
  if (n == 1) {
    cout << 0;
    return 0;
  }
  sort(a + 1, a + n + 1);
  if (b <= a[1]) {
    cout << a[n - 1] - b;
    return 0;
  }
  if (b >= a[n]) {
    cout << b - a[2];
    return 0;
  }
  Min = min(Min, abs(b - a[1]) + abs(a[1] - a[n - 1]));
  Min = min(Min, abs(b - a[2]) + abs(a[2] - a[n]));
  Min = min(Min, abs(b - a[n]) + abs(a[n] - a[2]));
  Min = min(Min, abs(b - a[n - 1]) + abs(a[n - 1] - a[1]));
  cout << Min;
  return 0;
}
