시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
1 초 512 MB 1 1 1 100.000%

문제

Being an experienced jogger, you decided to take a shortcut through a rectangular grain field, divided into three vertical patches full of rye, wheat and barley, respectively. You want to travel from its bottom left corner to the top right corner.

The proper jogging technique varies depending on which sort of grain you are trodding. Therefore, you will be going through the patches with three possibly different velocities. You may plan your route any way you wish (but without leaving the field).

Find the minimal time needed to get to the top right corner of the field from the bottom left corner.

입력

The first line of input contains the number of test cases $z$ ($1 \leq z \leq 10\,000$). The descriptions of the test cases follow.

Each test case is given on a single line containing seven integers $h, a, b, c, v_a, v_b, v_c$ ($1 \leq h, a, b, c, v_a, v_b, v_c \leq 10^5$): the height of the rectangular field, the widths of the patches, and the allowed velocities in these patches. Velocity $v$ means that you travel exactly $v$ units of distance per time unit.

출력

For each test case, output the total time needed to get from the bottom left corner to the top right one.

Your answer will be accepted if it differs from the correct one by no more than $10^{-3}$.

예제 입력 1

2
10 3 4 3 1 1 1
21 5 12 4 4 3 4

예제 출력 1

14.14213562
8.75