Problem: Natasha is going to fly on a rocket to Mars and return to Earth. Also, on the way to Mars, she will land on n - 2 intermediate planets. Formally: we number all the planets from 1 to n. 1 is Earth, n is Mars. Natasha will make exactly n flights: 1 → 2 → … n → 1.

Flight from x to y consists of two phases: take-off from planet x and landing to planet y. This way, the overall itinerary of the trip will be: the 1-st planet → take-off from the 1-st planet → landing to the 2-nd planet → 2-nd planet → take-off from the 2-nd planet → … → landing to the n-th planet → the n-th planet → take-off from the n-th planet → landing to the 1-st planet → the 1-st planet.

The mass of the rocket together with all the useful cargo (but without fuel) is m tons. However, Natasha does not know how much fuel to load into the rocket. Unfortunately, fuel can only be loaded on Earth, so if the rocket runs out of fuel on some other planet, Natasha will not be able to return home. Fuel is needed to take-off from each planet and to land to each planet. It is known that 1 ton of fuel can lift off a_i tons of rocket from the i-th planet or to land b_i tons of rocket onto the i-th planet. 

For example, if the weight of rocket is 9 tons, weight of fuel is 3 tons and take-off coefficient is 8 (a_i = 8), then 1.5 tons of fuel will be burnt (since 1.5 ⋅ 8 = 9 + 3). The new weight of fuel after take-off will be 1.5 tons. 

Please note, that it is allowed to burn non-integral amount of fuel during take-off or landing, and the amount of initial fuel can be non-integral as well.

Help Natasha to calculate the minimum mass of fuel to load into the rocket. Note, that the rocket must spend fuel to carry both useful cargo and the fuel itself. However, it doesn't need to carry the fuel which has already been burnt. Assume, that the rocket takes off and lands instantly.

Input

The first line contains a single integer n (2 ≤ n ≤ 1000) — number of planets.

The second line contains the only integer m (1 ≤ m ≤ 1000) — weight of the payload.

The third line contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 1000), where a_i is the number of tons, which can be lifted off by one ton of fuel.

The fourth line contains n integers b_1, b_2, …, b_n (1 ≤ b_i ≤ 1000), where b_i is the number of tons, which can be landed by one ton of fuel. 

It is guaranteed, that if Natasha can make a flight, then it takes no more than 10^9 tons of fuel.

Output

If Natasha can fly to Mars through (n - 2) planets and return to Earth, print the minimum mass of fuel (in tons) that Natasha should take. Otherwise, print a single number -1.

It is guaranteed, that if Natasha can make a flight, then it takes no more than 10^9 tons of fuel.

The answer will be considered correct if its absolute or relative error doesn't exceed 10^{-6}. Formally, let your answer be p, and the jury's answer be q. Your answer is considered correct if \frac{|p - q|}{max{(1, |q|)}} ≤ 10^{-6}.

Examples

Input

2
12
11 8
7 5


Output

10.0000000000


Input

3
1
1 4 1
2 5 3


Output

-1


Input

6
2
4 6 3 3 5 6
2 6 3 6 5 3


Output

85.4800000000

Note

Let's consider the first example.

Initially, the mass of a rocket with fuel is 22 tons.

  * At take-off from Earth one ton of fuel can lift off 11 tons of cargo, so to lift off 22 tons you need to burn 2 tons of fuel. Remaining weight of the rocket with fuel is 20 tons.
  * During landing on Mars, one ton of fuel can land 5 tons of cargo, so for landing 20 tons you will need to burn 4 tons of fuel. There will be 16 tons of the rocket with fuel remaining.
  * While taking off from Mars, one ton of fuel can raise 8 tons of cargo, so to lift off 16 tons you will need to burn 2 tons of fuel. There will be 14 tons of rocket with fuel after that.
  * During landing on Earth, one ton of fuel can land 7 tons of cargo, so for landing 14 tons you will need to burn 2 tons of fuel. Remaining weight is 12 tons, that is, a rocket without any fuel.



In the second case, the rocket will not be able even to take off from Earth.

Solution (in JAVA):

Solution:
import java.util.*;
public class binsearchapp1 {
    static int[] arr;
    static int[] brr;
    static int n;
    static double m;
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        n=sc.nextInt();
        m=sc.nextLong();
        arr=new int[n];
        brr=new int[n];
        for(int i=0;i<n;i++){
            arr[i]=sc.nextInt();
        }
        for(int i=0;i<n;i++){
            brr[i]=sc.nextInt();
        }
        //merge(arr,n);
        //System.out.println("aaya");
        long x=binsearch(0,1000000001,-1);
        double s=x, idk=0.1;
        if(x>0){
        for(int i=0;i<=9;i++){
            if(idk>0){
                int k=0;
                //System.out.println(i);
            while(check(s)&&(k<10)){

                //System.out.println(i);
                s-=idk;
                k++;
            }
            //System.out.println(idk);
            s+=idk;
            //System.out.println(s);
            idk/=10;
            }
            //System.out.println(i);
        }
        //System.out.println("aaya3");
        System.out.println(String.format("%.10f",s));}
        else
            System.out.println(x);
    }
    static long binsearch(long start, long end, long ans){
        if(start<=end){
            long mid=(start+end)/2;
            if(check(mid)){
                return binsearch(start,mid-1,mid);
            }
            else
                return binsearch(mid+1,end,ans);
        }
        else
            return ans;
    }
    static boolean check(double ans){
        double temp=m+ans;
        for(int j=0;j<n-1;j++){
            temp-=(temp/arr[j]);
            if(temp<m)
                return false;
            temp-=temp/brr[j+1];
            if(temp<m)
                return false;
        }
        temp-=(temp/arr[n-1]);
        if(temp<m)
            return false;
        temp-=(temp/brr[0]);
        if(temp<m)
            return false;
        return true;
    }
    public static void merge(int[] arr, int n){
        if(n==2){
            if(arr[0]>arr[1]){
                int temp=arr[0];
                arr[0]=arr[1];
                arr[1]=temp;
                return;
            }
        }
        else if(n!=1){
            int[] a=new int[n/2];
            int[] b=new int[n-(int)n/2];
            int i;
            for(i=0;i<n/2;i++){
                a[i]=arr[i];
            }

            for(int j=0;j<n-n/2;j++){
                b[j]=arr[i++];
            }
            merge(a,n/2);
            merge(b,n-(int)n/2);
            int k=0,l=0,m=0;
            while((l<n/2)&&(m<n-(int)n/2)){
                if(a[l]<b[m])
                    arr[k++]=a[l++];
                else
                    arr[k++]=b[m++];
            }
            while(l<n/2)
            {arr[k++]=a[l++];}
            while(m<n-(int)n/2){
                arr[k++]=b[m++];
            }
        }
        else
            return;
    }
}