Stalls are arranged in a line, and you need to place cows such that the minimum distance between any two cows is maximized.
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).
Print a single integer — the largest possible minimum distance between any two cows.
Example 1