No tag edit access

A. As Fast As Possible

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputOn vacations *n* pupils decided to go on excursion and gather all together. They need to overcome the path with the length *l* meters. Each of the pupils will go with the speed equal to *v* _{1}. To get to the excursion quickly, it was decided to rent a bus, which has seats for *k* people (it means that it can't fit more than *k* people at the same time) and the speed equal to *v* _{2}. In order to avoid seasick, each of the pupils want to get into the bus no more than once.

Determine the minimum time required for all *n* pupils to reach the place of excursion. Consider that the embarkation and disembarkation of passengers, as well as the reversal of the bus, take place immediately and this time can be neglected.

Input

The first line of the input contains five positive integers *n*, *l*, *v* _{1}, *v* _{2} and *k* (1 ≤ *n* ≤ 10 000, 1 ≤ *l* ≤ 10^{9}, 1 ≤ *v* _{1} < *v* _{2} ≤ 10^{9}, 1 ≤ *k* ≤ *n*) — the number of pupils, the distance from meeting to the place of excursion, the speed of each pupil, the speed of bus and the number of seats in the bus.

Output

Print the real number — the minimum time in which all pupils can reach the place of excursion. Your answer will be considered correct if its absolute or relative error won't exceed 10^{ - 6}.

Examples

Input

5 10 1 2 5

Output

5.0000000000

Input

3 6 1 2 1

Output

4.7142857143

Note

In the first sample we should immediately put all five pupils to the bus. The speed of the bus equals 2 and the distance is equal to 10, so the pupils will reach the place of excursion in time 10 / 2 = 5.

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Aug/09/2020 08:41:03 (h3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|