Qwerty the Ranger arrived to the Diatar system with a very important task. He should deliver a special carcinogen for scientific research to planet Persephone. This is urgent, so Qwerty has to get to the planet as soon as possible. A lost day may fail negotiations as nobody is going to pay for an overdue carcinogen.

You can consider Qwerty's ship, the planet Persephone and the star Diatar points on a plane. Diatar is located in the origin of coordinate axes — at point (0, 0). Persephone goes round Diatar along a circular orbit with radius R in the counter-clockwise direction at constant linear speed vp (thus, for instance, a full circle around the star takes <image> of time). At the initial moment of time Persephone is located at point (xp, yp).

At the initial moment of time Qwerty's ship is at point (x, y). Qwerty can move in any direction at speed of at most v (v > vp). The star Diatar is hot (as all stars), so Qwerty can't get too close to it. The ship's metal sheathing melts at distance r (r < R) from the star.

Find the minimum time Qwerty needs to get the carcinogen to planet Persephone.

Input

The first line contains space-separated integers xp, yp and vp ( - 104 ≤ xp, yp ≤ 104, 1 ≤ vp < 104) — Persephone's initial position and the speed at which it goes round Diatar.

The second line contains space-separated integers x, y, v and r ( - 104 ≤ x, y ≤ 104, 1 < v ≤ 104, 1 ≤ r ≤ 104) — The intial position of Qwerty's ship, its maximum speed and the minimum safe distance to star Diatar.

It is guaranteed that r2 < x2 + y2, r2 < xp2 + yp2 and vp < v.

Output

Print a single real number — the minimum possible delivery time. The answer will be considered valid if its absolute or relative error does not exceed 10 - 6.

Examples

Input

10 0 1
-10 0 2 8


Output

9.584544103

Input

50 60 10
50 60 20 40


Output

0.000000000
#include <bits/stdc++.h>
using namespace std;
const double MY_PI = 4 * atan2(1.0, 1.0);
struct Point {
  double x, y;
  Point() : x(-1.7171717), y(-1.7171717){};
  Point(double x_, double y_) : x(x_), y(y_){};
  double len(void) const { return sqrt(x * x + y * y); };
};
double atan2(const Point &A) { return atan2(A.y, A.x); }
Point operator+(const Point A, const Point B) {
  return Point(A.x + B.x, A.y + B.y);
}
Point operator-(const Point A, const Point B) {
  return Point(A.x - B.x, A.y - B.y);
}
Point fromPolar(double R, double alpha) {
  return Point(R * cos(alpha), R * sin(alpha));
}
double scal_mul(const Point &A, const Point &B) {
  return A.x * B.x + A.y * B.y;
}
double vect_mul(const Point &A, const Point &B) {
  return A.x * B.y - A.y * B.x;
}
bool segm_cross_circ(const Point &A, const Point &B, double R) {
  if (fabs(vect_mul(A, B)) / (A - B).len() >= R) return false;
  return scal_mul(A, B - A) <= 0.0 && scal_mul(B, A - B) <= 0.0;
}
Point find_touch(const Point &A, double R, double sign) {
  double alpha = atan2(A);
  return fromPolar(R, alpha + acos(R / A.len()) * sign);
}
double min_angle_between(double alpha, double beta) {
  double res = alpha - beta;
  if (res <= -MY_PI) res += 2 * MY_PI;
  if (res > +MY_PI) res -= 2 * MY_PI;
  return fabs(res);
}
double star__R;
double tot_dist(const Point &A, const Point &touch_0, const Point &touch_1,
                const Point &B) {
  return (touch_0 - A).len() +
         star__R * min_angle_between(atan2(touch_0), atan2(touch_1)) +
         (B - touch_1).len();
}
int main(int argc, char *argv[]) {
  Point Planet_start;
  cin >> Planet_start.x >> Planet_start.y;
  double planet_R = Planet_start.len();
  double planet_start_phi = atan2(Planet_start);
  double planet_v;
  cin >> planet_v;
  double planet_omega = planet_v / (planet_R);
  Point spaceship_start;
  cin >> spaceship_start.x >> spaceship_start.y;
  double spaceship_v;
  cin >> spaceship_v;
  cin >> star__R;
  double left = 0.0,
         right = (spaceship_start.len() + planet_R * (1.2 * MY_PI + 1.2)) /
                 spaceship_v;
  while (right - left > 1e-7) {
    double mid = (left + right) / 2.0;
    bool can_reach;
    Point Planet_curr =
        fromPolar(planet_R, planet_start_phi + planet_omega * mid);
    if (!segm_cross_circ(spaceship_start, Planet_curr, star__R))
      can_reach = (Planet_curr - spaceship_start).len() <= spaceship_v * mid;
    else {
      Point touch_0_1 = find_touch(spaceship_start, star__R, -1);
      Point touch_0_2 = find_touch(spaceship_start, star__R, +1);
      Point touch_1_1 = find_touch(Planet_curr, star__R, -1);
      Point touch_1_2 = find_touch(Planet_curr, star__R, +1);
      can_reach =
          min(min(tot_dist(spaceship_start, touch_0_1, touch_1_1, Planet_curr),
                  tot_dist(spaceship_start, touch_0_1, touch_1_2, Planet_curr)),
              min(tot_dist(spaceship_start, touch_0_2, touch_1_1, Planet_curr),
                  tot_dist(spaceship_start, touch_0_2, touch_1_2,
                           Planet_curr))) <= spaceship_v * mid;
    }
    if (can_reach)
      right = mid;
    else
      left = mid;
  }
  cout.precision(12);
  cout << (left + right) / 2.0;
  return 0;
}
