Problem: Peter got a new snow blower as a New Year present. Of course, Peter decided to try it immediately. After reading the instructions he realized that it does not work like regular snow blowing machines. In order to make it work, you need to tie it to some point that it does not cover, and then switch it on. As a result it will go along a circle around this point and will remove all the snow from its path.

Formally, we assume that Peter's machine is a polygon on a plane. Then, after the machine is switched on, it will make a circle around the point to which Peter tied it (this point lies strictly outside the polygon). That is, each of the points lying within or on the border of the polygon will move along the circular trajectory, with the center of the circle at the point to which Peter tied his machine.

Peter decided to tie his car to point P and now he is wondering what is the area of ​​the region that will be cleared from snow. Help him.

Input

The first line of the input contains three integers — the number of vertices of the polygon n (<image>), and coordinates of point P.

Each of the next n lines contains two integers — coordinates of the vertices of the polygon in the clockwise or counterclockwise order. It is guaranteed that no three consecutive vertices lie on a common straight line.

All the numbers in the input are integers that do not exceed 1 000 000 in their absolute value.

Output

Print a single real value number — the area of the region that will be cleared. 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

3 0 0
0 1
-1 2
1 2


Output

12.566370614359172464


Input

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


Output

21.991148575128551812

Note

In the first sample snow will be removed from that area:

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
struct point {
  double x, y;
  point() { x = y = 0.0; }
  point(double _x, double _y) : x(_x), y(_y) {}
};
int n;
point f[100005];
point e;
vector<point> ch;
struct vec {
  double x, y;
  vec() { x = y = 0.0; }
  vec(double _x, double _y) : x(_x), y(_y) {}
};
vec toVec(point p1, point p2) { return vec(p2.x - p1.x, p2.y - p1.y); }
double dot(vec a, vec b) { return (a.x * b.x + a.y * b.y); }
double cross(vec a, vec b) { return a.x * b.y - a.y * b.x; }
vec scale(vec v, double s) { return vec(v.x * s, v.y * s); }
point translate(point p, vec v) { return point(p.x + v.x, p.y + v.y); }
bool ccw(point p, point q, point r) {
  return (cross(toVec(p, q), toVec(p, r)) > 0);
}
bool collinear(point p, point q, point r) {
  return fabs(cross(toVec(p, q), toVec(p, r))) < 1e-9;
}
double norm_sq(vec v) { return v.x * v.x + v.y * v.y; }
double angle(point a, point o, point b) {
  vec oa = toVec(o, a);
  vec ob = toVec(o, b);
  return acos(dot(oa, ob) / sqrt(norm_sq(oa) * norm_sq(ob)));
}
double dist(point a, point b) {
  double x = a.x - b.x;
  double y = a.y - b.y;
  x = x * x;
  y = y * y;
  return sqrt(x + y);
}
double cross(point p, point q, point r) {
  double ax, ay, bx, by;
  ax = q.x - p.x;
  ay = q.y - p.y;
  bx = r.x - p.x;
  by = r.y - p.y;
  return ax * by - ay * bx;
}
bool cmp(point a, point b) {
  if (a.x == b.x) return a.y < b.y;
  return a.x < b.x;
}
bool inPolygon(point pt, const vector<point> &P) {
  if ((int)P.size() == 0) return false;
  double sum = 0;
  for (int i = 0; i < (int)P.size() - 1; i++) {
    if (ccw(pt, P[i], P[i + 1]))
      sum += angle(P[i], pt, P[i + 1]);
    else
      sum -= angle(P[i], pt, P[i + 1]);
  }
  return fabs(fabs(sum) - 2 * acos(-1)) < 1e-9;
}
double distToLine(point p, point a, point b, point &c) {
  vec ap = toVec(a, p);
  vec ab = toVec(a, b);
  double u = dot(ap, ab) / norm_sq(ab);
  c = translate(a, scale(ab, u));
  return dist(p, c);
}
double distToLineSegment(point p, point a, point b, point &c) {
  vec ap = toVec(a, p);
  vec ab = toVec(a, b);
  double u = dot(ap, ab) / norm_sq(ab);
  if (u < 0.0) {
    c = point(a.x, a.y);
    return dist(p, a);
  }
  if (u > 1.0) {
    c = point(b.x, b.y);
    return dist(p, b);
  }
  return distToLine(p, a, b, c);
}
void convexhull() {
  sort(f, f + n, cmp);
  ch.clear();
  for (int i = 0; i < n; i++) {
    while (ch.size() >= 2 && cross(ch[ch.size() - 2], ch.back(), f[i]) <= 0)
      ch.pop_back();
    ch.push_back(f[i]);
  }
  int bef = ch.size() + 1;
  for (int i = n - 2; i >= 0; i--) {
    while (ch.size() >= bef && cross(ch[ch.size() - 2], ch.back(), f[i]) <= 0)
      ch.pop_back();
    ch.push_back(f[i]);
  }
}
int main() {
  scanf("%d%lf%lf", &n, &e.x, &e.y);
  double maxr = -1e18, minr = 1e18;
  for (int i = 0; i < n; i++) {
    scanf("%lf%lf", &f[i].x, &f[i].y);
    maxr = max(dist(e, f[i]), maxr);
  }
  for (int i = 0; i < n - 1; i++) {
    point tmp;
    double temp = distToLineSegment(e, f[i], f[i + 1], tmp);
    minr = min(minr, dist(e, tmp));
  }
  point tmp;
  double temp = distToLineSegment(e, f[0], f[n - 1], tmp);
  minr = min(minr, dist(e, tmp));
  convexhull();
  if (inPolygon(e, ch)) minr = 0;
  double areabig = acos(-1) * maxr * maxr;
  double areasmall = acos(-1) * minr * minr;
  printf("%.20lf\n", areabig - areasmall);
  return 0;
}