Moving walkway
Bob is a renowned scientist who frequently attends various conferences. On one of his trips, he found himself running late for his flight and needed to reach terminal A as quickly as possible. The airport features a horizontal moving walkway that can help Bob move faster. Bob is familiar with the airport's layout, including the entrance, terminal A, and the start and end points of the moving walkway.
Imagine the airport as a coordinate plane: the entrance is at point (0, 0), terminal A is at point (x_1, y_1), and the moving walkway starts at (x_2, y_2) and ends at (x_3, y_3). Bob's walking speed is v, while the walkway moves at speed w. The walkway can only be used from its start to its end. Your task is to help Bob determine the minimum time required to travel from the airport entrance to terminal A. Note that due to the walkway's handrails, Bob cannot cross it; he can only enter at the start and travel to the end at speed w.
Input
The first line of input contains six integers: x_1, y_1, x_2, y_2, x_3, y_3 (-10000 ≤ x_1, x_2, x_3 ≤ 10000, 0 < y_1, y_2, y_3 ≤ 10000). These represent the coordinates of terminal A and the start and end points of the moving walkway. The second line contains two integers v, w (0 < v ≤ 50, 0 < w ≤ 50), indicating Bob's speed and the walkway's speed.
It is guaranteed that neither terminal A nor the airport entrance lies on the moving walkway.
Output
Output the minimum time it will take Bob to travel from the entrance to terminal A. The result is considered accurate if it differs from the minimum by no more than 10^{-5}.