Catch Fantômas#2692
Commissioner Juve, while in city , learned that Fantômas is departing from city on his submarine. To arrive in city in time, the commissioner needs to find the most optimal route from city to city .
Between cities and lies a rectangular area of width km, which is divided into zones. Each zone has a height h_i km. In each zone, due to the local terrain, the commissioner can travel at a speed of V_i km/h. The width of the horizontal section of each zone is denoted by Z_i.
The first line contains and — the total width of the area and the number of zones, separated by spaces.
The second line contains h_i — the height of each zone, separated by spaces.
The third line contains V_i — the speed at which the commissioner can travel in each zone, separated by spaces.
The fourth line contains — the zone number for which you need to determine Z_k, the width of the -th zone.
1 \leq N \leq 1000; 1 \leq K \leq N; 1 \leq L, H, V \leq 10000. All input values are integers.
Output the value of Z_k, rounded to decimal places.
Example 1