Cover the Polygon with Your Disk

Place a fixed-radius disk anywhere on the plane to maximize the area shared with a convex polygon, and print that maximum.

Hard8GeometryBinary searchImplementationNo attempts yetTime limit3sMemory limit512 MB

Problem

A convex polygon is drawn on a flat sheet of paper. You put a disk of radius rr on the paper so that the area shared by the polygon and the disk is as large as possible. The center of the disk can go anywhere on the paper, and its coordinates do not have to be integers.

Compute that largest shared area.

Input

The input is one test case in the following format. Every value in the input is an integer.

n r
x1 y1
.
.
.
xn yn

nn is the number of vertices of the polygon, with 3n103 \le n \le 10. rr is the radius of the disk, with 1r1001 \le r \le 100. xix_i and yiy_i are the coordinates of the ii-th vertex, with 0xi1000 \le x_i \le 100 and 0yi1000 \le y_i \le 100.

The vertices are given in counterclockwise order. The polygon is convex, so every interior angle is smaller than 180180^\circ and the boundary never crosses or touches itself.

Output

Print the largest shared area on one line, rounded to four digits after the decimal point. Always print exactly four digits after the decimal point, even when they are zeros. For an answer of 0.50.5, print 0.5000.