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;
using pii = pair<int, int>;
using ll = long long;
const int INF = (int)1e9 + 7, mod = (int)1e9 + 9, pw = 31, N = (int)1e5 + 123,
          M = (int)1e6 + 123;
const double eps = 1e-11, dfdf = 3.141592653589793;
const long long inf = 1e18;
struct Point {
  double x, y;
  Point(){};
  Point(double a, double b) : x(a), y(b) {}
  void in() { cin >> x >> y; }
};
struct Segment {
  Point a, b;
  Segment() {}
  Segment(Point x, Point y) : a(x), b(y) {}
};
struct Ray {
  Point a, b;
  Ray() {}
  Ray(Point x, Point y) : a(x), b(y) {}
};
struct Line {
  Point p, t;
  double a, b, c;
  Line() {}
  Line(Point x, Point y)
      : p(x), t(y), a(y.y - x.y), b(x.x - y.x), c(x.y * y.x - x.x * y.y) {}
};
struct Vector {
  double x, y;
  Vector() {}
  Vector(double a, double b) : x(a), y(b) {}
  Vector(Point a, Point b) : x(b.x - a.x), y(b.y - a.y) {}
};
double crossProduct(Vector a, Vector b) { return a.x * b.y - a.y * b.x; }
double dotProduct(Vector a, Vector b) { return a.x * b.x + a.y * b.y; }
double pointDistance(Point a, Point b) {
  return sqrt((b.x - a.x) * (b.x - a.x) + (b.y - a.y) * (b.y - a.y));
}
double distance(Point a, Line b) {
  return fabs(crossProduct(Vector(a, b.p), Vector(a, b.t))) /
         pointDistance(b.p, b.t);
}
double distance(Point a, Segment b) {
  if (dotProduct(Vector(b.a, a), Vector(b.a, b.b)) >= 0 &&
      dotProduct(Vector(b.b, a), Vector(b.b, b.a)) >= 0)
    return distance(a, Line(b.a, b.b));
  return min(pointDistance(a, b.a), pointDistance(a, b.b));
}
double distance(Point a, Ray b) {
  if (dotProduct(Vector(b.a, a), Vector(b.a, b.b)) >= 0)
    return distance(a, Line(b.a, b.b));
  return pointDistance(a, b.a);
}
bool isIntersected(Segment a, Segment b) {
  double first = crossProduct(Vector(a.a, a.b), Vector(a.a, b.a));
  double second = crossProduct(Vector(a.a, a.b), Vector(a.a, b.b));
  if (first < 0 && second < 0) return 0;
  if (first > 0 && second > 0) return 0;
  first = crossProduct(Vector(b.a, b.b), Vector(b.a, a.a));
  second = crossProduct(Vector(b.a, b.b), Vector(b.a, a.b));
  if (first < 0 && second < 0) return 0;
  if (first > 0 && second > 0) return 0;
  double x_min = min(a.a.x, a.b.x);
  double x_max = max(a.a.x, a.b.x);
  double y_min = min(a.a.y, a.b.y);
  double y_max = max(a.a.y, a.b.y);
  double x2_min = min(b.a.x, b.b.x);
  double x2_max = max(b.a.x, b.b.x);
  double y2_min = min(b.a.y, b.b.y);
  double y2_max = max(b.a.y, b.b.y);
  if (x_max < x2_min || x2_max < x_min) return 0;
  if (y_max < y2_min || y2_max < y_min) return 0;
  return 1;
}
double segmentDistance(Segment a, Segment b) {
  if (isIntersected(a, b)) return 0;
  return min(min(distance(a.a, b), distance(a.b, b)),
             min(distance(b.a, a), distance(b.b, a)));
}
bool isContained(Point c, Segment a) {
  if (fabs(crossProduct(Vector(a.a, a.b), Vector(a.a, c)) - 0) < eps &&
      dotProduct(Vector(c, a.a), Vector(c, a.b)) <= 0)
    return 1;
  return 0;
}
bool isContained(Point c, Ray a) {
  if (fabs(crossProduct(Vector(a.a, a.b), Vector(a.a, c)) - 0) < eps &&
      dotProduct(Vector(a.a, a.b), Vector(a.a, c)) >= 0)
    return 1;
  return 0;
}
bool isContained(Point c, Line a) {
  if (fabs(a.a * c.x + a.b * c.y + a.c - 0) < eps) return 1;
  return 0;
}
bool isIntersected(Line a, Line b) {
  if (fabs(a.a * b.b - b.a * a.b - 0) < eps) return 0;
  return 1;
}
Point intersection(Line a, Line b) {
  if (fabs(a.a - 0) > eps) {
    double y = (b.a * a.c - a.a * b.c) / (a.a * b.b - b.a * a.b);
    return Point((((-1.0) * a.c) - (a.b * y)) / a.a, y);
  }
  double x = (b.b * a.c - a.b * b.c) / (b.a * a.b - b.b * a.a);
  return Point(x, (((-1.0) * a.c) - (a.a * x)) / a.b);
}
bool isIntersected(Segment b, Ray a) {
  if (!isIntersected(Line(a.a, a.b), Line(b.a, b.b))) return 0;
  Point t = intersection(Line(a.a, a.b), Line(b.a, b.b));
  if (isContained(t, a) && isContained(t, b)) return 1;
  return 0;
}
double lineDistance(Line a, Line b) {
  if (isIntersected(a, b)) return 0;
  return distance(a.p, b);
}
double distance(Segment a, Ray b) {
  if (isIntersected(a, b)) return 0;
  return min(min(distance(a.a, b), distance(a.b, b)), distance(b.a, a));
}
bool isIntersected(Segment b, Line a) {
  if (!isIntersected(Line(a.p, a.t), Line(b.a, b.b))) return 0;
  Point t = intersection(Line(a.p, a.t), Line(b.a, b.b));
  if (isContained(t, a) && isContained(t, b)) return 1;
  return 0;
}
double distance(Segment a, Line b) {
  if (isIntersected(a, b)) return 0;
  return min(distance(a.a, b), distance(a.b, b));
}
bool isIntersected(Ray a, Ray b) {
  if (!isIntersected(Line(a.a, a.b), Line(b.a, b.b))) return 0;
  Point t = intersection(Line(a.a, a.b), Line(b.a, b.b));
  if (isContained(t, a) && isContained(t, b)) return 1;
  return 0;
}
double rayDistance(Ray a, Ray b) {
  if (isIntersected(a, b)) return 0;
  return min(distance(a.a, b), distance(b.a, a));
}
bool isIntersected(Ray a, Line b) {
  if (!isIntersected(Line(a.a, a.b), Line(b.p, b.t))) return 0;
  Point t = intersection(Line(a.a, a.b), Line(b.p, b.t));
  if (isContained(t, a) && isContained(t, b)) return 1;
  return 0;
}
double distance(Ray a, Line b) {
  if (isIntersected(a, b)) return 0;
  return distance(a.a, b);
}
pii a[N], second;
int n;
double mini, maxi;
double sqr(double x) { return x * x; }
double dis(pii a) {
  return sqrt(sqr(a.first - second.first) + sqr(a.second - second.second));
}
double area(double r) { return dfdf * r * r; }
double near(pii a, pii b) {
  Point x = Point(second.first, second.second);
  Segment y = Segment(Point(a.first, a.second), Point(b.first, b.second));
  return distance(x, y);
}
int main() {
  scanf("%d%d%d", &n, &second.first, &second.second);
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &a[i].first, &a[i].second);
    if (i == 1) mini = maxi = dis(a[i]);
    mini = min(mini, dis(a[i]));
    maxi = max(maxi, dis(a[i]));
  }
  mini = min(mini, near(a[1], a[n]));
  for (int i = 2; i <= n; i++) {
    mini = min(mini, near(a[i], a[i - 1]));
  }
  printf("%.9f", area(maxi) - area(mini));
  return 0;
}