Cows - in the stalls#5149

Cows - in the stalls

1 second
64 megabytes
Very easy

Stalls are arranged in a line, and you need to place cows such that the minimum distance between any two cows is maximized.

Input

The first line contains two integers: (2 < n < 10001) — the number of stalls, and (1 < k < n) — the number of cows. The second line lists natural numbers in ascending order, representing the coordinates of the stalls (each coordinate does not exceed 10^9).

Output

Print a single integer — the largest possible minimum distance between any two cows.

Examples

Example 1

Loading
Loading