Problem: A team of furry rescue rangers was sitting idle in their hollow tree when suddenly they received a signal of distress. In a few moments they were ready, and the dirigible of the rescue chipmunks hit the road.

We assume that the action takes place on a Cartesian plane. The headquarters of the rescuers is located at point (x1, y1), and the distress signal came from the point (x2, y2).

Due to Gadget's engineering talent, the rescuers' dirigible can instantly change its current velocity and direction of movement at any moment and as many times as needed. The only limitation is: the speed of the aircraft relative to the air can not exceed <image> meters per second.

Of course, Gadget is a true rescuer and wants to reach the destination as soon as possible. The matter is complicated by the fact that the wind is blowing in the air and it affects the movement of the dirigible. According to the weather forecast, the wind will be defined by the vector (vx, vy) for the nearest t seconds, and then will change to (wx, wy). These vectors give both the direction and velocity of the wind. Formally, if a dirigible is located at the point (x, y), while its own velocity relative to the air is equal to zero and the wind (ux, uy) is blowing, then after <image> seconds the new position of the dirigible will be <image>.

Gadget is busy piloting the aircraft, so she asked Chip to calculate how long will it take them to reach the destination if they fly optimally. He coped with the task easily, but Dale is convinced that Chip has given the random value, aiming only not to lose the face in front of Gadget. Dale has asked you to find the right answer.

It is guaranteed that the speed of the wind at any moment of time is strictly less than the maximum possible speed of the airship relative to the air.

Input

The first line of the input contains four integers x1, y1, x2, y2 (|x1|, |y1|, |x2|, |y2| ≤ 10 000) — the coordinates of the rescuers' headquarters and the point, where signal of the distress came from, respectively. 

The second line contains two integers <image> and t (0 < v, t ≤ 1000), which are denoting the maximum speed of the chipmunk dirigible relative to the air and the moment of time when the wind changes according to the weather forecast, respectively. 

Next follow one per line two pairs of integer (vx, vy) and (wx, wy), describing the wind for the first t seconds and the wind that will blow at all the remaining time, respectively. It is guaranteed that <image> and <image>.

Output

Print a single real value — the minimum time the rescuers need to get to point (x2, y2). You answer will be considered correct if its absolute or relative error does not exceed 10 - 6. 

Namely: let's assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct, if <image>.

Examples

Input

0 0 5 5
3 2
-1 -1
-1 0


Output

3.729935587093555327


Input

0 0 0 1000
100 1000
-50 0
50 0


Output

11.547005383792516398

Solution (in PYTHON):

Solution:
#import string,itertools,fractions,heapq,re,array,bisect
from math import *
#from collections import Counter
def rl(s): return xrange(len(s))

INF = 2147483647


import sys
stdin = sys.stdin

def dot(a, b): return a.real*b.real + a.imag*b.imag
def sizeSq(a): return dot(a, a)
def normalise(a): return a / abs(a)

def nearestPtOnLine(pt, a, adir):
    ndir = normalise(adir)
    return a + dot((pt - a), ndir) * ndir

def intersectLineCircle(a, adir, centre, radius, eps):
    closest_approach = nearestPtOnLine(centre, a, adir)
    from_centre_sq = sizeSq(closest_approach - centre)
    if from_centre_sq > (radius + eps) * (radius + eps):
        return None
    along_line = radius*radius - from_centre_sq
    if along_line < 0:
        along_line = 0
    else:
        along_line = sqrt(along_line)
    step = along_line * normalise(adir)
    return [closest_approach - step, closest_approach + step]


x1, y1, x2, y2 = map(int, stdin.readline().strip().split())
vmax, t = map(int, stdin.readline().strip().split())
vx, vy = map(int, stdin.readline().strip().split())
wx, wy = map(int, stdin.readline().strip().split())

dest = (x2 + 1j*y2) - (x1 + 1j*y1)
v = vx + 1j*vy
w = wx + 1j*wy

maxreach = vmax*t
centre = t * v
if abs(dest) < 1e-5:
    print 0
elif abs(centre - dest) < maxreach:
    pts = intersectLineCircle(0, dest, centre, maxreach, 1e-9)
    pt = pts[dot(dest, pts[0]) < 0]
    print  t * abs(dest) / abs(pt)
else:
    centre -= dest
    left = 0
    right = 1e9
    for i in range(1000):
        mid = 0.5*(left + right)
        its_at = -mid*w
        dist_left = abs(its_at - centre) - maxreach
        if vmax * mid >= dist_left:
            right = mid
        else:
            left = mid
    print t + 0.5*(left + right)