There are n people and k keys on a straight line. Every person wants to get to the office which is located on the line as well. To do that, he needs to reach some point with a key, take the key and then go to the office. Once a key is taken by somebody, it couldn't be taken by anybody else.

You are to determine the minimum time needed for all n people to get to the office with keys. Assume that people move a unit distance per 1 second. If two people reach a key at the same time, only one of them can take the key. A person can pass through a point with a key without taking it.

Input

The first line contains three integers n, k and p (1 ≤ n ≤ 1 000, n ≤ k ≤ 2 000, 1 ≤ p ≤ 109) — the number of people, the number of keys and the office location.

The second line contains n distinct integers a1, a2, ..., an (1 ≤ ai ≤ 109) — positions in which people are located initially. The positions are given in arbitrary order.

The third line contains k distinct integers b1, b2, ..., bk (1 ≤ bj ≤ 109) — positions of the keys. The positions are given in arbitrary order.

Note that there can't be more than one person or more than one key in the same point. A person and a key can be located in the same point.

Output

Print the minimum time (in seconds) needed for all n to reach the office with keys.

Examples

Input

2 4 50
20 100
60 10 40 80


Output

50


Input

1 2 10
11
15 7


Output

7

Note

In the first example the person located at point 20 should take the key located at point 40 and go with it to the office located at point 50. He spends 30 seconds. The person located at point 100 can take the key located at point 80 and go to the office with it. He spends 50 seconds. Thus, after 50 seconds everybody is in office with keys.
#include <bits/stdc++.h>
using namespace std;
long long a[2005], b[2005];
long long n, k, p;
int cmp(long long u, long long v) { return u < v; }
struct node {
  long long le, ri;
} seg[2005];
int cmp1(node u, node v) { return u.le < v.le; }
int check(long long x) {
  int i;
  for (i = 0; i < n; i++) {
    long long now = fabs(p - a[i]);
    if (now > x) return 0;
    seg[i].le = min(p, a[i]) - ((x - now) >> 1);
    seg[i].ri = max(p, a[i]) + ((x - now) >> 1);
  }
  sort(seg, seg + n, cmp1);
  int now = 0;
  for (i = 0; i < n; i++) {
    while (!(b[now] >= seg[i].le && b[now] <= seg[i].ri)) {
      now++;
      if (now >= k) return 0;
    }
    now++;
  }
  return 1;
}
int main() {
  int i, j, x;
  cin >> n >> k >> p;
  for (i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (i = 0; i < k; i++) {
    cin >> b[i];
  }
  sort(b, b + k, cmp);
  long long le = 0, ri = 0x3f3f3f3f3f3f3f3f, mid, ans;
  while (le <= ri) {
    mid = (le + ri) >> 1;
    if (check(mid)) {
      ans = mid;
      ri = mid - 1;
    } else
      le = mid + 1;
  }
  cout << ans << endl;
  return 0;
}
