Among other things, Bob is keen on photography. Especially he likes to take pictures of sportsmen. That was the reason why he placed himself in position x₀ of a long straight racetrack and got ready to take pictures. But the problem was that not all the runners passed him. The total amount of sportsmen, training at that racetrack, equals n. And each of them regularly runs distances within a particular segment of the racetrack, which is the same for each sportsman. For example, the first sportsman runs from position a₁ to position b₁, the second — from a₂ to b₂

What is the minimum distance that Bob should move to have a chance to take pictures of each sportsman? Bob can take a picture of a sportsman, if he stands within the segment that this sportsman covers on the racetrack.

The first line of the input file contains integers n and x₀ (1 ≤ n ≤ 100; 0 ≤ x₀ ≤ 1000). The following n lines contain pairs of integers a_i, b_i (0 ≤ a_i, b_i ≤ 1000; a_i ≠ b_i).

Output the required minimum distance in the same units as the positions on the racetrack. If there is no such a position, output -1.