Input consists of a number of cases each presented on a separate line. Each line consists of a sequence of numbers. The first number is d the width of the strip of wood to be cut off of each edge of the tabletop in centimeters. The next number n is an integer giving the number of vertices of the polygon. The next n pairs of numbers present xi and yi coordinates of polygon vertices for 1 <= i <= n given in clockwise order. A line containing only two zeroes terminate the input.
d is much smaller than any of the sides of the polygon. The beavers cut the edges one after another and after each cut the number of vertices of the tabletop is the same.
For each line of input produce one line of output containing one number to three decimal digits in the fraction giving the area of the tabletop after cutting.
2 4 0 0 0 5 5 5 5 0 1 3 0 0 0 5 5 0 1 3 0 0 3 5.1961524 6 0 3 4 0 -10 -10 0 0 10 10 0 0 0
1.000 1.257 2.785 66.294