#D11822. Line Distance

    ID: 9835 Type: Default 7500ms 256MiB

Line Distance

Line Distance

You are given an integer k and n distinct points with integer coordinates on the Euclidean plane, the i-th point has coordinates (x_i, y_i).

Consider a list of all the (n(n - 1))/(2) pairs of points ((x_i, y_i), (x_j, y_j)) (1 ≤ i < j ≤ n). For every such pair, write out the distance from the line through these two points to the origin (0, 0).

Your goal is to calculate the k-th smallest number among these distances.

Input

The first line contains two integers n, k (2 ≤ n ≤ 10^5, 1 ≤ k ≤ (n(n - 1))/(2)).

The i-th of the next n lines contains two integers x_i and y_i (-10^4 ≤ x_i, y_i ≤ 10^4) — the coordinates of the i-th point. It is guaranteed that all given points are pairwise distinct.

Output

You should output one number — the k-th smallest distance from the origin. Your answer is considered correct if its absolute or relative error does not exceed 10^{-6}.

Formally, let your answer be a, and the jury's answer be b. Your answer is accepted if and only if \frac{|a - b|}{max{(1, |b|)}} ≤ 10^{-6}.

Example

Input

4 3 2 1 -2 -1 0 -1 -2 4

Output

0.707106780737

Note

There are 6 pairs of points:

  • Line 1-2 : distance 0 from the origin
  • Line 1-3 : distance \frac{√{2}}{2} ≈ 0.707106781 from the origin
  • Line 1-4 : distance 2 from the origin
  • Line 2-3 : distance 1 from the origin
  • Line 2-4 : distance 2 from the origin
  • Line 3-4 : distance \frac{2}{√{29}} ≈ 0.371390676 from the origin

The third smallest distance among those is approximately 0.707106781.

inputFormat

Input

The first line contains two integers n, k (2 ≤ n ≤ 10^5, 1 ≤ k ≤ (n(n - 1))/(2)).

The i-th of the next n lines contains two integers x_i and y_i (-10^4 ≤ x_i, y_i ≤ 10^4) — the coordinates of the i-th point. It is guaranteed that all given points are pairwise distinct.

outputFormat

Output

You should output one number — the k-th smallest distance from the origin. Your answer is considered correct if its absolute or relative error does not exceed 10^{-6}.

Formally, let your answer be a, and the jury's answer be b. Your answer is accepted if and only if \frac{|a - b|}{max{(1, |b|)}} ≤ 10^{-6}.

Example

Input

4 3 2 1 -2 -1 0 -1 -2 4

Output

0.707106780737

Note

There are 6 pairs of points:

  • Line 1-2 : distance 0 from the origin
  • Line 1-3 : distance \frac{√{2}}{2} ≈ 0.707106781 from the origin
  • Line 1-4 : distance 2 from the origin
  • Line 2-3 : distance 1 from the origin
  • Line 2-4 : distance 2 from the origin
  • Line 3-4 : distance \frac{2}{√{29}} ≈ 0.371390676 from the origin

The third smallest distance among those is approximately 0.707106781.

样例

4 3
2 1
-2 -1
0 -1
-2 4
0.7071067375364

</p>