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;
const long double EPS = 1e-9;
const long double PI = acos(-1.0);
struct point_i {
  int x, y;
  point_i() {}
  point_i(int _x, int _y) : x(_x), y(_y) {}
  bool operator<(point_i other) const {
    if (x != other.x) return x < other.x;
    return y < other.y;
  }
  bool operator==(point_i other) const {
    return (x == other.x && y == other.y);
  }
};
struct point {
  long double x, y;
  point() {}
  point(long double _x, long double _y) : x(_x), y(_y) {}
  bool operator<(point other) const {
    if (fabs(x - other.x) > EPS) return x < other.x;
    return y < other.y;
  }
  bool operator==(point other) const {
    return (fabs(x - other.x) < EPS && fabs(y - other.y) < EPS);
  }
};
long double dist2(point p1, point p2) {
  return (p1.x - p2.x) * (p1.x - p2.x) + (p1.y - p2.y) * (p1.y - p2.y);
}
long double dist(point p1, point p2) { return sqrt(dist2(p1, p2)); }
int dist2(point_i p1, point_i p2) {
  return (p1.x - p2.x) * (p1.x - p2.x) + (p1.y - p2.y) * (p1.y - p2.y);
}
long double dist(point_i p1, point_i p2) { return sqrt(dist2(p1, p2)); }
point rotate(point p, long double theta) {
  return point(p.x * cos(theta) - p.y * sin(theta),
               p.x * sin(theta) + p.y * cos(theta));
}
struct line {
  long double a, b, c;
};
void pointsToLine(point p1, point p2, line& l) {
  if (fabs(p1.x - p2.x) < EPS) {
    l.a = 1.0, l.b = 0.0, l.c = -p1.x;
  } else {
    l.a = -(long double)(p1.y - p2.y) / (p1.x - p2.x);
    l.b = 1.0;
    l.c = -(long double)(l.a * p1.x) - p1.y;
  }
}
bool areParallel(line l1, line l2) {
  return (fabs(l1.a - l2.a) < EPS && fabs(l1.b - l2.b) < EPS);
}
bool areSame(line l1, line l2) {
  return (areParallel(l1, l2) && fabs(l1.c - l2.c) < EPS);
}
bool areIntersect(line l1, line l2, point& p) {
  if (areParallel(l1, l2)) return false;
  p.x = (l1.c * l2.b - l2.c * l1.b) / (l2.a * l1.b - l1.a * l2.b);
  if (fabs(l1.b) > EPS)
    p.y = -(l1.a * p.x + l1.c);
  else
    p.y = -(l2.a * p.x + l2.c);
  return true;
}
struct vec {
  long double x, y;
  vec(long double _x, long double _y) : x(_x), y(_y) {}
};
vec toVec(point p1, point p2) { return vec(p2.x - p1.x, p2.y - p1.y); }
vec scale(vec v, long double s) { return vec(s * v.x, s * v.y); }
point translate(point p, vec v) { return point(p.x + v.x, p.y + v.y); }
long double dot(vec v1, vec v2) { return (v1.x * v2.x + v1.y * v2.y); }
long double norm2(vec v) { return dot(v, v); }
long double distToLine(point p, point a, point b, point& c) {
  vec ap = toVec(a, p);
  vec ab = toVec(a, b);
  long double u = dot(ap, ab) / norm2(ab);
  c = translate(a, scale(ab, u));
  return dist(p, c);
}
long double distToSegment(point p, point a, point b, point& c) {
  vec ap = toVec(a, p);
  vec ab = toVec(a, b);
  long double u = dot(ap, ab) / norm2(ab);
  if (u < 0.0) {
    c = point(a.x, a.y);
    return dist(p, a);
  } else if (u > 1.0) {
    c = point(b.x, b.y);
    return dist(p, b);
  }
  return distToLine(p, a, b, c);
}
const int MAX = 100009;
const long double oo = 1e12;
int n;
point arr[MAX];
point P;
int main() {
  ios::sync_with_stdio(false);
  int a, b;
  cin >> n >> a >> b;
  P = point(a, b);
  for (int i = 0; i < n; i++) cin >> arr[i].x >> arr[i].y;
  long double Min = oo, Max = 0.0;
  for (int i = 0; i < n; i++) Max = max(Max, dist(P, arr[i]));
  for (int i = 0; i < n; i++) {
    int j = (i + 1) % n;
    point r;
    Min = min(Min, distToSegment(P, arr[i], arr[j], r));
  }
  cout << fixed << setprecision(15) << (Max * Max - Min * Min) * PI << endl;
  return 0;
}