HDU6573 Traffic(交通）（纯IDEA）

Problem Description

Avin is observing the cars at a crossroads. He finds that there are n cars running in the east-west direction with the i-th car passing the intersection at time ai . There are another m cars running in the north-south direction with the i-th car passing the intersection at time bi . If two cars passing the intersections at the same time, a traffic crash occurs. In order to achieve world peace and harmony, all the cars running in the north-south direction wait the same amount of integral time so that no two cars bump. You are asked the minimum waiting time.

埃尔文在观测路口的车辆。他发现有n辆车东西向行驶，第i辆车通过路口的时刻是ai。另m辆车南北行驶，通过路口的时刻是bi。如果两辆车同时经过路口，那么交通事故就会发生。为了实现世界的和平与和谐，所有南北方向的车都要等待相同的时间从而不会有相撞事故。你需要计算出这个最小等待时间。

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 1, 000). The second line contains n distinct integers ai (1 ≤ ai ≤ 1, 000). The third line contains m distinct integers bi (1 ≤ bi ≤ 1, 000).

Output

Print a non-negative integer denoting the minimum waiting time.

Sample Input

1 1 1 1 1 2 2 1 3

Sample Output

1 0

对于这个题，没必要进行过程模拟，只需要判定当某一时间t的时候是否满足南北方向的车都可以通过且不和东西方向的车撞在一起就可以了。