In the famous card-collecting game Hearthstone, there is an exciting card named Yogg Saron, Master of Fate, with a battlecry effect of "If you've cast $10$ spells during the game, spin the Wheel of Yogg Saron!" 

Six distinct options are contained in the Wheel of Yogg Saron, with a probability of being chosen for each option. Among all options, the one with the least probability of being chosen is "Rod of Roasting." However, this option also has the most devastating effect: Randomly cast "Pyroblast" until a player dies! Here, "Pyroblast" is a spell of mage class, with the effect of dealing damage to some unit.


Now, given the health point of you and your opponent and the health point of minions on the board, you want to know: If now a battlecry of Yogg Saron, Master of Fate is triggered and the option of "Rod of Roasting" is chosen, what is the probability of you surviving the pyroblasts and winning the game?

Formally, assume your health point is , and the health point of at most minions on your board are respectively. Also, your opponent's health point is and the health point of at most minions on your opponent's board are , respectively. The option of "Rod of Roasting" is equivalent to the following stochastic process:

• Repeat until  or : Choose from  an element  greater than zero uniformly at random and set 
• If , you win. Otherwise, your opponent wins.

The first line contains eight integers , denoting the health point of you and your minions.

The second line contains eight integers , denoting the health point of your opponent and your opponent's minions.

Output an integer in a line, denoting the probability of you winning the game. Under the input constraints of this problem, it can be shown that the answer can be written as , where  and  are coprime integers and . You need to output  as an answer, where  is the modular inverse of  with respect to .

30 5 0 0 0 0 0 0
30 5 0 0 0 0 0 0

499122177

10 0 0 0 0 0 0 0
11 0 0 0 0 0 0 0

748683265