Problem Description

huicpc0860 likes drawing,but not good at drawing.One day, he gets a software of drawing.
The software provides a eraser B,you can consider it like a convex hull. Yet, the eraser can make your draw from black to white.Now give you a black convex hull A which you can consider like a drawing, and a white convex hull which is a eraser.Now, we only know the angle a between the eraser's moving direction and the x-axis,and I want to move the eraser the least distance to make the remaind part area of the drawing is K percent of the original's.

Input

First line is the number of soiled area A's vectors NA(3<=NA<=100).Follows NA lines, describes the convex polygon counterclockwise, each line has two decimal xi, yi ( -10000 ≤ xi, yi ≤ 10000) representatives one vector's coordinate.
Then, another line is the number of soiled area B's vectors NB(3<=NB<=100).Follows NB lines, describes the convex polygon counterclockwise, each line has two decimal xi, yi ( -10000 ≤ xi, yi ≤ 10000) representatives one vector's coordinate.
Lastest line has two decimal, a and K.a (0 ≤a< 360)is the direction's angle with x positive axis and K is the rate.

Output

Only one line for each case,the minimum distance D (retain four digitals after decimal point).
If it's impossible to get,output -1.

4
0 0
2 0
2 2
0 2
4
-2 0
-1 0
-1 1
-2 1
0 0.75
3
-2 -1
-1 0
-2 1
3
1 -1
2 0
1 1
180 0.5

2.0000
2.7071