## VPL2_AA - Luis Quest

Luis is playing his old metroid game. Just a little while ago he pass trough a scenario where the room was filled with some amoeba-like creatures. The room started with some initial number of creatures, but they multiply their selves very quickly, because their growth rate is proportional to the number of creatures at a certain time. Luis took note about this fact, he wrote the number of creatures at the initial time, and then, after wait t time units, he wrote the new amount. Now Luis wants to know, for a certain number of creatures p, the exact time he has to be in the room to see that amount.

### Input

The first line contains an integer T, which specifies the number of test cases. Then, will follow the descriptions of T test cases.

For each test case, there will be 2 lines, the first one will contain 4 integers, p0, p1, t and p. These numbers represents the initial amount of creatures, the second amount of creatures, the time units that Luis waited to see that change, and the number of creatures that Luis wants to see.

### Output

For each input case you must print a single line containing the string "`Scenario #i: `" where i is the number of the test case (starting at one), and then the answer to the problem rounded to two decimal places. There will always be an answer.

### Example

Input:4 10 15 3 15 10 15 3 20 5 12 2 50 5 12 2 7Output:Scenario #1: 3.00 Scenario #2: 5.13 Scenario #3: 5.26 Scenario #4: 0.77

### Constraints - 100%

1 ≤ T, p0, p1, t, p ≤ 100

Added by: | Venezuelan Programming League |

Date: | 2013-06-22 |

Time limit: | 1s |

Source limit: | 50000B |

Memory limit: | 1536MB |

Cluster: | Cube (Intel G860) |

Languages: | All except: ASM64 |