Roy and Alfi reside in two different cities, Roy in city A and Alfi in city B. Roy wishes to meet her in city B.

There are two trains available from city A to city B. Roy is on his way to station A (Railway station of city A). It will take \(T_0\) time (in minutes) for Roy to reach station A. The two trains departs in \(T_1\) and \(T_2\) minutes respectively. Average velocities (in km/hr) of trains are \(V_1\) and \(V_2\) respectively. We know the distance D (in km) between city A and city B. Roy wants to know the minimum time (in minutes) to reach city B, if he chooses train optimally.

If its not possible to reach city B, print "-1" instead (without quotes).

Note: If the minimum time is not integral, round the value to the least integer greater than minimum time.

Input:

First line will contain integer T, number of test cases.

Second line will contain integers ** \(T_0, T_1, T_2, V_1, V_2, D\) ** (their meanings are mentioned in problem statement)

Output:

Print the integral result, minimum time (in minutes) to reach city B in a new line.

Constraints:

\(1 \le T \le 10000\)

\(1 \le T_0,T_1,T_1 \le 1000\)

\( 1 \le V_1,V_2 \le 500\)

\(1 \le D \le 5000\)