Granny keeps her moonshine whiskey in a cream can, and a surprise inspection by Eliot Ness is imminent. Before he arrives she wants to remove as much whiskey from the can as possible.
She can upend the can to pour its contents onto the ground, but because of surface tension and the shape of the can a fixed volume $V_r$ of liquid always clings to the inside and cannot be poured out. To wash out more whiskey she has a barrel of rain water and may rinse the can up to $k$ times.
The can starts holding $V_w$ units of pure whiskey. Each rinse works like this:
Whiskey and water mix perfectly and their volumes are additive. Granny has time for at most $k$ rinses and a total of $V_b$ units of rain water. By choosing how much water to use on each rinse, she wants to minimize the volume of whiskey still left in the can after her final rinse.
The input contains several test cases. Each test case is a single line with five numbers:
A line containing a single $0$ follows the last test case and must not be processed.
For each test case, print on its own line the minimum possible volume of residual whiskey left in the can after at most $k$ rinses, rounded to exactly six decimal places.
The total amount of water used across all rinses may not exceed $V_b$, and the total liquid in the can may never exceed $V_c$ at any moment. Assume whiskey and water mix perfectly and that their volumes add: combining $x$ units of whiskey with $y$ units of water yields exactly $x + y$ units of liquid.