Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
D. Plane of Tanks: Duel

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputVasya plays the Plane of Tanks.

Tanks are described with the following attributes:

- the number of hit points;
- the interval between two gun shots (the time required to recharge the gun);
- the probability that the gun shot will not pierce armor of the enemy tank;
- the damage to the enemy's tank.

The gun damage is described with a segment [*l*, *r*], where *l* and *r* are integer numbers. The potential gun damage *x* is chosen with equal probability among all integer numbers of the segment [*l*, *r*]. If the shot pierces the armor of an enemy's tank then the enemy loses *x* hit points. If the number of hit points becomes non-positive then the enemy tank is considered destroyed.

It is possible that the shot does not pierce the armor of a tank. In this case the number of hit points doesn't change. The probability that the armor will not be pierced is considered as the shooting tank attribute and does not depend on players' behavior.

The victory is near and there is only one enemy tank left. Vasya is ready for the battle — one more battle between the Good and the Evil is inevitable! Two enemies saw each other and each of them fired a shot at the same moment... The last battle has begun! Help Vasya to determine what is the probability that he will win the battle by destroying the enemy tank?

If both tanks are destroyed (after simultaneous shots), then Vasya is considered a winner. You can assume that each player fires a shot just after the gun recharge and each tank has infinite number of ammo.

Input

The first line contains five integer numbers separated with spaces describing Vasya's tank: the number of hit points *hp* (10 ≤ *hp* ≤ 200), the interval between two shots *dt* (1 ≤ *dt* ≤ 30), gun damage segment *l* and *r* (10 ≤ *l* ≤ *r* ≤ 100), the probability that the enemy's tank armor will not be pierced *p* (0 ≤ *p* ≤ 100) (percents).

The second line describes the tank of Vasya's enemy in the same format.

Output

Print the only number with absolute or relative error no more than 10^{ - 4} — probability of Vasya's victory.

Examples

Input

100 3 50 50 0

100 3 50 50 0

Output

1.000000

Input

100 3 50 50 0

100 2 48 50 0

Output

0.888889

Input

100 3 50 50 0

100 1 50 50 50

Output

0.500000

Note

In the first example both tanks are destroyed at once after the second shot. The probability of destroying the enemy tank is 1.

In the second example Vasya's enemy tank fires the second shot before Vasya's tank, but has no time for the third shot. In order to destroy Vasya's tank it is necessary to fire two shots with damage 50. The probability of that event is = . Otherwise, Vasya wins.

In the third example Vasya's enemy tank fires three shots with probability of armor piercing 0.5. In order to destroy Vasya's tank it is necessary that at least 2 of 3 shots pierce the armor of Vasya's tank. The probability of this event is 0.5.

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/19/2021 10:49:44 (h2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|