eolymp
bolt
Try our new interface for solving problems
Problems

The Hunting

The Hunting

Barr interested in one of the ways to catch the Snark, which he read in the manual found \textit{\textbf{3/4Snark Hunting for Dummies in 21 days}}?. Snark can be caught this way: 3/4Ohotniki have night landing on the island from different angles and closer to a point. Then, some participants drop out hunting each other ropes, so that we obtain a closed polygon, within which sleeps Snark. After that the capture is a matter of technique, of course, if all could be quite quiet. Blagozvon want, using this method, do the minimum amount of rope: after all, its stock on the ship are limited, and after capture, Snark, you may have to communicate. In addition, there is another problem the maximum length to which you can throw a rope, and is limited to \textbf{K}. Calculate the minimum length of rope, given the final coordinates of all the catchers and position, hopefully, sleeping Snark. \InputFile The first line contains the number of members of the expedition \textbf{N} - integer from \textbf{3} to \textbf{100} and \textbf{K} - the maximum length of a piece of rope, a real number greater than \textbf{0} and not exceeding \textbf{30000}. The next line is given pair of coordinates of the Snark. Further written \textbf{N} pairs of coordinates \textbf{X_i}, \textbf{Y_i} final position of each of the members of the expedition, the pair of coordinates in one line. Coordinates are given with \textbf{4} characters after the decimal point and do not exceed \textbf{10000}. \OutputFile The minimum length of rope required to within five decimal places.
Time limit 2 seconds
Memory limit 64 MiB
Input example #1
3 6.00
1.0000 1.0000
0.0000 0.0000
0.0000 3.0000
4.0000 0.0000
Output example #1
12.00000