402383: GYM100741 E Slicing cheese

You have a polygon defined by N points (x_i, y_i) and a polyline defined by M points (a_j, b_j). Polyline cuts polygon into some number of smaller polygons. Find the total perimeter P of resulting polygons. Polyline is guaranteed to start and end outside of the polygon. Each segment of polyline has no more than 1 common point with any segment of polygon segments. All points in the input are distinct. (a_j, b_j) does not lie on any line segment of the polygon.

First line contains integers N and M. (3 ≤ N ≤ 1000, 2 ≤ M ≤ 1000)

Next N lines contain integers x_i and y_i.

Next M lines contain integers a_j and b_j.

( - 10⁵ ≤ x_i, y_i, a_j, b_j ≤ 10⁵)

Output a single number P.

The answer is considered correct if its relative or absolute error doesn't exceed 10^- 6.

4 2
0 0
10 0
10 10
0 10
5 -1
5 11

60.000000000000000