#include <bits/stdc++.h>
using namespace std;
template <typename T>
T gcd(T a, T b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
template <typename T>
T pow(T a, T b, long long m) {
  T ans = 1;
  while (b > 0) {
    if (b % 2 == 1) ans = (ans * a) % m;
    b /= 2;
    a = (a * a) % m;
  }
  return ans % m;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, k, p;
  cin >> n >> k >> p;
  long long people[5000];
  int keys[5000];
  for (int i = 0; i < n; i++) cin >> people[i];
  sort(people, people + n);
  for (int i = 0; i < k; i++) cin >> keys[i];
  sort(keys, keys + k);
  long long ans = 100000000000000;
  for (int i = 0; i <= k - n; i++) {
    long long a = 0;
    for (int j = 0; j < n; j++)
      a = max(a, abs(people[j] - keys[i + j]) + abs(keys[i + j] - p));
    ans = min(ans, a);
  }
  cout << ans;
  return 0;
}
