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 JAVA):

Solution:
	import java.awt.geom.Line2D;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Scanner;
	
	
	/*07:05:45PM
	
	String x =sc.next();
	char inp [] = x.toCharArray();
		SimpleDateFormat displayFormat = new SimpleDateFormat("HH:mm");
		SimpleDateFormat parseFormat = new SimpleDateFormat("hh:mm a");
		Date date = parseFormat.parse(x.substring(0, 5)+" "+x.substring(8, 10));
		System.out.println(displayFormat.format(date)+":"+x.substring(6, 8));
	*/
	
	
	
	
	
	
	
	
	public class Main {
	public static long l=10000000000L;
	
		public static void main(String[] args) throws Exception {
			PrintWriter out = new PrintWriter(System.out);	
			StringBuilder sb = new StringBuilder();
			Scanner sc = new Scanner(System.in);
			long n =sc.nextLong() , x =sc.nextLong()  , y=sc.nextLong();
			double minimunDist = Long.MAX_VALUE;
			double maximumDist = Long.MIN_VALUE;
			double arr[][] = new double[(int)n][2];
			int i =0;
			while(n-->0)
			{
				double temp1=sc.nextLong() , temp2=sc.nextLong();
				minimunDist=Math.min(minimunDist,Math.sqrt((x-temp1)*(x-temp1)+(y-temp2)*(y-temp2)));
				maximumDist=Math.max(maximumDist,Math.sqrt((x-temp1)*(x-temp1)+(y-temp2)*(y-temp2)));
				arr[i][0]=temp1; arr[i++][1]=temp2;
			}	
			for (int j = 0; j < arr.length; j++) 
					{
						int j2=j+1;
						if(j2==arr.length)j2=0;
						minimunDist=Math.min(minimunDist, Line2D.ptSegDist(arr[j][0],arr[j][1],arr[j2][0],arr[j2][1], x,y));
					}
			//System.out.println(minimunDist);
			//System.out.println(maximumDist);
			
			out.printf("%.18f",Math.PI*((maximumDist*maximumDist)-(minimunDist*minimunDist)));	out.flush();out.close();	
		}
	}
	
	
	
	
	
	
	
	
	class Pair implements Comparable<Pair>
	{
		public int  x  ,y ,z ;
		Pair(int a , int b , int l)
		{
			x=a;y=b;z=l;
		}
		@Override
		public boolean equals(Object obj) {
			// TODO Auto-generated method stub
			return x==((Pair)(obj)).x && y==((Pair)obj).y;
		}
		
		@Override
		public int hashCode() {
			// TODO Auto-generated method stub
			return 6*x +8*y;
		}
		@Override
		public int compareTo(Pair o) {
			// TODO Auto-generated method stub
			return x*o.y - y*o.x;
		}
		
		
	}
	/*
	 class Scanner 
	{
		StringTokenizer st;
		BufferedReader br;
	
		public Scanner(InputStream s){	br = new BufferedReader(new InputStreamReader(s));}
	
		public String next() throws IOException 
		{
			while (st == null || !st.hasMoreTokens()) 
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}
	
		public int nextInt() throws IOException {return Integer.parseInt(next());}
		
		public long nextLong() throws IOException {return Long.parseLong(next());}
	
		public String nextLine() throws IOException {return br.readLine();}
		
		public double nextDouble() throws IOException
		{
			String x = next();
			StringBuilder sb = new StringBuilder("0");
			double res = 0, f = 1;
			boolean dec = false, neg = false;
			int start = 0;
			if(x.charAt(0) == '-')
			{
				neg = true;
				start++;
			}
			for(int i = start; i < x.length(); i++)
				if(x.charAt(i) == '.')
				{
					res = Long.parseLong(sb.toString());
					sb = new StringBuilder("0");
					dec = true;
				}
				else
				{
					sb.append(x.charAt(i));
					if(dec)
						f *= 10;
				}
			res += Long.parseLong(sb.toString()) / f;
			return res * (neg?-1:1);
		}
		
		public boolean ready() throws IOException {return br.ready();}
	
	
	}
*/