Problem: The first ship with the Earth settlers landed on Mars. The colonists managed to build n necessary structures on the surface of the planet (which can be regarded as a plane, and the construction can be regarded as points on it). But one day the scanners recorded suspicious activity on the outskirts of the colony. It was decided to use the protective force field generating system to protect the colony against possible trouble.

The system works as follows: the surface contains a number of generators of the field (they can also be considered as points). The active range of each generator is a circle of radius r centered at the location of the generator (the boundary of the circle is also included in the range). After the system is activated, it stretches the protective force field only over the part of the surface, which is within the area of all generators' activity. That is, the protected part is the intersection of the generators' active ranges.

The number of generators available to the colonists is not limited, but the system of field generation consumes a lot of energy. More precisely, the energy consumption does not depend on the number of generators, but it is directly proportional to the area, which is protected by the field. Also, it is necessary that all the existing buildings are located within the protected area.

Determine the smallest possible area of the protected part of the surface containing all the buildings.

Input

The first line contains two integers n and r (1 ≤ n ≤ 105, 1 ≤ r ≤ 50000) — the number of buildings and the active ranges of the generators, correspondingly.

Next n lines contains the buildings' coordinates. The i + 1-th (1 ≤ i ≤ n) line contains two real numbers with at most three digits after the decimal point xi and yi (|xi|, |yi| ≤ 50000) — coordinates of the i-th building. It is guaranteed that no two buildings are located at the same point, and no two different buildings are located closer than 1.

It is guaranteed that there exists a circle with radius r that contains all the buildings.

Output

Print the single real number — the minimum area of the protected part containing all the buildings. The answer is accepted if absolute or relative error doesn't exceed 10 - 4.

Examples

Input

3 5
0.00 0.000
0.0 8.00
6 8.00


Output

78.5398163397


Input

4 1000
0.0 0.0
0 2.00
2.00 2
2.0 0.00


Output

4.0026666140


Input

4 5
3.00 0.0
-3 0.00
0.000 1
0.0 -1.00


Output

8.1750554397

Note

In the first sample the given radius equals the radius of the circle circumscribed around the given points. That's why the circle that corresponds to it is the sought area. The answer is 25π.

In the second sample the area nearly coincides with the square which has vertexes in the given points.

The area for the third sample is shown on the picture below.

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-12;
const int maxn = 1e5;
struct vec {
  double x, y;
  vec(void) {}
  vec(double x, double y) : x(x), y(y) {}
  vec operator+(const vec &b) const { return vec(x + b.x, y + b.y); }
  vec operator-(const vec &b) const { return vec(x - b.x, y - b.y); }
  vec operator*(double b) const { return vec(x * b, y * b); }
  double det(const vec &b) const { return x * b.y - y * b.x; }
  double dot(const vec &b) const { return x * b.x + y * b.y; }
  double len(void) const { return sqrt(norm()); }
  double norm(void) const { return x * x + y * y; }
  bool operator<(const vec &b) const {
    return fabs(x - b.x) < eps ? y < b.y : x < b.x;
  }
  bool operator==(const vec &b) const {
    return fabs(x - b.x) < eps && fabs(y - b.y) < eps;
  }
};
int n;
vec a[maxn];
int m;
int b[maxn];
double rad;
double Cross(vec a, vec b, vec c) { return (b - a).det(c - a); }
double Acos(double t) {
  if (t > 1 - eps) return acos(1);
  if (t < -1 + eps) return acos(-1);
  return acos(t);
}
double GetA(double len) {
  return Acos((2 * rad * rad - len * len) / (2 * rad * rad));
}
void Convex(void) {
  sort(a, a + n);
  m = 0;
  for (int i = 0; i < n; ++i) {
    while (m > 1 && Cross(a[b[m - 2]], a[b[m - 1]], a[i]) <= eps) {
      --m;
    }
    b[m++] = i;
  }
  for (int i = n - 2, k = m; i >= 0; --i) {
    while (m > k && Cross(a[b[m - 2]], a[b[m - 1]], a[i]) <= eps) {
      --m;
    }
    b[m++] = i;
  }
  --m;
  if (m == 2 && a[b[0]] == a[b[1]]) {
    --m;
  }
}
struct Node {
  int id, prev, next;
} nd[maxn];
bool inque[maxn];
int head;
int main(void) {
  scanf("%d%lf", &n, &rad);
  for (int i = 0; i < n; ++i) {
    scanf("%lf%lf", &a[i].x, &a[i].y);
  }
  Convex();
  if (m == 1) {
    puts("0");
    return 0;
  }
  queue<int> q;
  for (int i = 0; i < m; ++i) {
    nd[i] = (Node){b[i], (i + m - 1) % m, (i + 1) % m};
    q.push(i);
    inque[i] = true;
  }
  head = 0;
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    inque[u] = false;
    int v1 = nd[u].prev, v2 = nd[u].next;
    if (GetA((a[nd[u].id] - a[nd[v1].id]).len()) +
            GetA((a[nd[u].id] - a[nd[v2].id]).len()) <=
        GetA((a[nd[v1].id] - a[nd[v2].id]).len())) {
      nd[v1].next = v2;
      nd[v2].prev = v1;
      if (!inque[v1]) {
        inque[v1] = true;
        q.push(v1);
      }
      if (!inque[v2]) {
        inque[v2] = true;
        q.push(v2);
      }
      head = v1;
      if (--m == 1) {
        puts("BAD");
        throw;
      }
    }
  }
  double ans = 0;
  for (int u = head;;) {
    int v = nd[u].next;
    int i = nd[u].id, j = nd[v].id;
    ans += a[i].det(a[j]);
    double t = GetA((a[i] - a[j]).len());
    ans += rad * rad * (t - sin(t));
    if ((u = v) == head) break;
  }
  printf("%.10lf\n", ans * 0.5);
  return 0;
}