Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

binary search

brute force

dp

greedy

sortings

*1800

No tag edit access

The problem statement has recently been changed. View the changes.

×
A. Office Keys

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThere 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* ≤ 10^{9}) — the number of people, the number of keys and the office location.

The second line contains *n* distinct integers *a*_{1}, *a*_{2}, ..., *a*_{n} (1 ≤ *a*_{i} ≤ 10^{9}) — positions in which people are located initially. The positions are given in arbitrary order.

The third line contains *k* distinct integers *b*_{1}, *b*_{2}, ..., *b*_{k} (1 ≤ *b*_{j} ≤ 10^{9}) — 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.

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Sep/23/2023 21:36:26 (i2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|