Problem: After a drawn-out mooclear arms race, Farmer John and the Mischievous Mess Makers have finally agreed to establish peace. They plan to divide the territory of Bovinia with a line passing through at least two of the n outposts scattered throughout the land. These outposts, remnants of the conflict, are located at the points (x1, y1), (x2, y2), ..., (xn, yn).

In order to find the optimal dividing line, Farmer John and Elsie have plotted a map of Bovinia on the coordinate plane. Farmer John's farm and the Mischievous Mess Makers' base are located at the points P = (a, 0) and Q = ( - a, 0), respectively. Because they seek a lasting peace, Farmer John and Elsie would like to minimize the maximum difference between the distances from any point on the line to P and Q.

Formally, define the difference of a line <image> relative to two points P and Q as the smallest real number d so that for all points X on line <image>, |PX - QX| ≤ d. (It is guaranteed that d exists and is unique.) They wish to find the line <image> passing through two distinct outposts (xi, yi) and (xj, yj) such that the difference of <image> relative to P and Q is minimized.

Input

The first line of the input contains two integers n and a (2 ≤ n ≤ 100 000, 1 ≤ a ≤ 10 000) — the number of outposts and the coordinates of the farm and the base, respectively.

The following n lines describe the locations of the outposts as pairs of integers (xi, yi) (|xi|, |yi| ≤ 10 000). These points are distinct from each other as well as from P and Q.

Output

Print a single real number—the difference of the optimal dividing line. Your answer will be considered correct if its absolute or relative error does not exceed 10 - 6. 

Namely: let's assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct, if <image>.

Examples

Input

2 5
1 0
2 1


Output

7.2111025509


Input

3 6
0 1
2 5
0 -3


Output

0.0000000000

Note

In the first sample case, the only possible line <image> is y = x - 1. It can be shown that the point X which maximizes |PX - QX| is (13, 12), with <image>, which is <image>.

In the second sample case, if we pick the points (0, 1) and (0, - 3), we get <image> as x = 0. Because PX = QX on this line, the minimum possible difference is 0.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1);
struct point {
  int x, y;
};
point p[120000];
point u, v;
pair<double, double> h[120000];
set<double> S;
int i, m, n;
double l, r, mid;
inline double dist(point x, point y) {
  return sqrt((x.x - y.x) * (x.x - y.x) + (x.y - y.y) * (x.y - y.y));
}
inline bool check(double r2) {
  int k = 0;
  for (int i = 1; i <= n; i++) {
    double r1 = dist(p[i], u);
    double d = dist(p[i], v);
    if (r1 + r2 < d) continue;
    if (r2 + d < r1) continue;
    if (r1 + d < r2) return true;
    double c1 = acos((r2 * r2 + d * d - r1 * r1) / (2 * r2 * d));
    double c2 = atan2(p[i].x - v.x, p[i].y - v.y);
    k++, h[k] = make_pair(c2 - c1, c2 + c1);
    if (h[k].first < -pi)
      h[k].first = h[k].first + 2 * pi, swap(h[k].first, h[k].second);
    if (h[k].second > pi)
      h[k].second = h[k].second - 2 * pi, swap(h[k].first, h[k].second);
  }
  sort(h + 1, h + k + 1);
  S.clear();
  for (int i = 1; i <= k; i++) {
    if ((S.size()) && (S.lower_bound(h[i].first) != S.lower_bound(h[i].second)))
      return false;
    S.insert(h[i].second);
  }
  return true;
}
int main() {
  scanf("%d%d", &n, &m);
  u = (point){-m, 0}, v = (point){m, 0};
  for (i = 1; i <= n; i++) scanf("%d%d", &p[i].x, &p[i].y);
  l = 0, r = 2 * m;
  for (i = 1; i <= 50; i++) {
    mid = (l + r) / 2;
    if (check(mid))
      l = mid;
    else
      r = mid;
  }
  printf("%.10lf", l);
  return 0;
}