The World Programming Olympics Medal is a metal disk, consisting of two parts: the first part is a ring with outer radius of r₁ cm, inner radius of r₂ cm, (0 < r2 < r1) made of metal with density p₁ g/cm³. The second part is an inner disk with radius r₂ cm, it is made of metal with density p₂ g/cm³. The disk is nested inside the ring.

The Olympic jury decided that r₁ will take one of possible values of x₁, x₂, ..., x_n. It is up to jury to decide which particular value r₁ will take. Similarly, the Olympic jury decided that p₁ will take one of possible value of y₁, y₂, ..., y_m, and p₂ will take a value from list z₁, z₂, ..., z_k.

According to most ancient traditions the ratio between the outer ring mass m_out and the inner disk mass m_in must equal , where A, B are constants taken from ancient books. Now, to start making medals, the jury needs to take values for r₁, p₁, p₂ and calculate the suitable value of r₂.

The jury wants to choose the value that would maximize radius r₂. Help the jury find the sought value of r₂. Value r₂ doesn't have to be an integer.

Medal has a uniform thickness throughout the area, the thickness of the inner disk is the same as the thickness of the outer ring.

The first input line contains an integer n and a sequence of integers x₁, x₂, ..., x_n. The second input line contains an integer m and a sequence of integers y₁, y₂, ..., y_m. The third input line contains an integer k and a sequence of integers z₁, z₂, ..., z_k. The last line contains two integers A and B.

All numbers given in the input are positive and do not exceed 5000. Each of the three sequences contains distinct numbers. The numbers in the lines are separated by spaces.

Print a single real number — the sought value r₂ with absolute or relative error of at most 10^- 6. It is guaranteed that the solution that meets the problem requirements exists.