We call any sequence of points in the plane a plot. We want to replace a given plot (P1,…,Pn) with another one that has at most m points (m≤n) and resembles the original as closely as possible.
The new plot is built as follows. The sequence (P1,…,Pn) is split into s (s≤m) contiguous subsequences
(Pk0+1,…,Pk1), (Pk1+1,…,Pk2), …, (Pks−1+1,…,Pks)
where 0=k0<k1<k2<⋯<ks=n. Then each subsequence (Pki−1+1,…,Pki) (for i=1,…,s) is replaced by a single new point Qi. We say that each of the points Pki−1+1,…,Pki has been contracted to the point Qi. The result is a new plot consisting of the points Q1,…,Qs.
The resemblance of such a plot to the original is measured by the maximum distance from any point P1,…,Pn to the point it was contracted to:
maxi=1,…,s(maxj=ki−1+1,…,kid(Pj,Qi))
where d(Pj,Qi) is the distance between the two points, given by the well-known formula
d((x1,y1),(x2,y2))=(x2−x1)2+(y2−y1)2

The figure above shows an example plot (P1,…,P7) and the new plot (Q1,Q2), where (P1,…,P4) are contracted to Q1 and (P5,P6,P7) to Q2.
Given a plot of n points, among all plots with at most m points obtainable this way (the split into contiguous subsequences is arbitrary), the resemblance to the original can be made as small as possible. Find that smallest possible resemblance value d.
The first line contains two integers n and m separated by a single space (1≤m≤n≤100000). Each of the next n lines contains two integers separated by a single space; the i-th of them gives xi and yi (−1000000≤xi,yi≤1000000), the coordinates (xi,yi) of the point Pi.
Print a single real number d: the minimum possible resemblance (the smallest achievable value of the maximum contraction distance) over all plots with at most m points. Print it rounded to exactly 6 digits after the decimal point.