Rabbit Olympics
Organizing of Rabbit Olympics is a difficult thing, even for such a dedicated rabbit as Stan. Stan tries to make the show spectacular, but also (being a patriot of his country) wants to make it easier for the audience to attend the grand event.
Stan knows that the key to success - the simplification. So he simplified his country to one-dimension so that the location of each city in Rabbitland can be represented as one integer. Given the location of all cities. Stan can build no more than K stadiums. He is going to build them in the way to minimize the greatest distance (of course, one-dimensional), which the fans have to cover to the nearest stadium. Please help Stan to calculate this value.
Input
The first line of input contains to space separated integers: the number of cities N (1 ≤ N ≤ 100000) and the number of stadiums K (1 ≤ K≤ 100000). The second line contains the list of city coordinates – N space separated integers, which absolute value do not exceed 10^9.
Output
Output the result with two digits after the decimal point in the single line.