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 ai tons of rocket from the i-th planet or to land bi 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 (ai=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.
Plese 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 a1,a2,…,an (1≤ai≤1000), where ai is the number of tons, which can be lifted off by one ton of fuel.
The fourth line contains n integers b1,b2,…,bn (1≤bi≤1000), where bi 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 109 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 109 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 |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.

读题读到爆炸
这题意思就是飞行过程中有几个星球 给定每个星球起飞和降落时1吨燃料能支持多重的飞船（包括燃料重量）
求出发时最少需要多少燃料
其实直接从最后逆推即可 比如只要保证从最后一个星球起飞后燃料刚好完，也就是剩下飞船重量（比如12） 那么这个过程就是 12+x5=x 12 + x 5 = x 这里的5就是最后一个星球起飞一顿燃料可以承担的重量，解出x就是燃料种类，这样一步一步推到起点即可

代码：

#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
int a[2100];
int n,m;
int main(void){
    scanf("%d%d",&n,&m);
    for(int i=1;i<2*n;i+=2){
        scanf("%d",&a[i]);
    }
    for(int i=2;i<=2*n;i+=2){
        scanf("%d",&a[i]);
    }
    bool flag=false;
    double o=0;
    double r=(double)m;
    for(int i=2*n;i>0;i--){
        if(a[i]==1){
            flag=true;
            break;
        }
        double t=r/(a[i]-1);
        o+=t;
        r+=t;
    }
    if(flag){
        printf("-1\n");
    }
    else{
        printf("%.15lf\n",o);
    }
    return 0;
}