Problem: Once upon a time in the galaxy of far, far away...

Darth Wader found out the location of a rebels' base. Now he is going to destroy the base (and the whole planet that the base is located at), using the Death Star.

When the rebels learnt that the Death Star was coming, they decided to use their new secret weapon — space mines. Let's describe a space mine's build.

Each space mine is shaped like a ball (we'll call it the mine body) of a certain radius r with the center in the point O. Several spikes protrude from the center. Each spike can be represented as a segment, connecting the center of the mine with some point P, such that <image> (transporting long-spiked mines is problematic), where |OP| is the length of the segment connecting O and P. It is convenient to describe the point P by a vector p such that P = O + p.

The Death Star is shaped like a ball with the radius of R (R exceeds any mine's radius). It moves at a constant speed along the v vector at the speed equal to |v|. At the moment the rebels noticed the Star of Death, it was located in the point A.

The rebels located n space mines along the Death Star's way. You may regard the mines as being idle. The Death Star does not know about the mines' existence and cannot notice them, which is why it doesn't change the direction of its movement. As soon as the Star of Death touched the mine (its body or one of the spikes), the mine bursts and destroys the Star of Death. A touching is the situation when there is a point in space which belongs both to the mine and to the Death Star. It is considered that Death Star will not be destroyed if it can move infinitely long time without touching the mines.

Help the rebels determine whether they will succeed in destroying the Death Star using space mines or not. If they will succeed, determine the moment of time when it will happen (starting from the moment the Death Star was noticed).

Input

The first input data line contains 7 integers Ax, Ay, Az, vx, vy, vz, R. They are the Death Star's initial position, the direction of its movement, and its radius ( - 10 ≤ vx, vy, vz ≤ 10, |v| > 0, 0 < R ≤ 100).

The second line contains an integer n, which is the number of mines (1 ≤ n ≤ 100). Then follow n data blocks, the i-th of them describes the i-th mine.

The first line of each block contains 5 integers Oix, Oiy, Oiz, ri, mi, which are the coordinates of the mine centre, the radius of its body and the number of spikes (0 < ri < 100, 0 ≤ mi ≤ 10). Then follow mi lines, describing the spikes of the i-th mine, where the j-th of them describes the i-th spike and contains 3 integers pijx, pijy, pijz — the coordinates of the vector where the given spike is directed (<image>).

The coordinates of the mines' centers and the center of the Death Star are integers, their absolute value does not exceed 10000. It is guaranteed that R > ri for any 1 ≤ i ≤ n. For any mines i ≠ j the following inequality if fulfilled: <image>. Initially the Death Star and the mines do not have common points.

Output

If the rebels will succeed in stopping the Death Star using space mines, print the time from the moment the Death Star was noticed to the blast.

If the Death Star will not touch a mine, print "-1" (without quotes).

For the answer the absolute or relative error of 10 - 6 is acceptable.

Examples

Input

0 0 0 1 0 0 5
2
10 8 0 2 2
0 -3 0
2 2 0
20 0 0 4 3
2 4 0
-4 3 0
1 -5 0


Output

10.0000000000

Input

8 8 4 4 4 2 6
1
-2 -2 -1 3 0


Output

-1

Input

30 30 2 1 2 1 20
3
0 0 40 5 1
1 4 4
-10 -40 -5 7 0
100 200 95 8 1
-10 0 0


Output

74.6757620881

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const double eps = 1e-6;
int sgn(double x) { return x > eps ? 1 : x < -eps ? -1 : 0; }
struct pt {
  double x, y, z;
  pt() {}
  pt(double _x, double _y, double _z) : x(_x), y(_y), z(_z) {}
  pt operator-(const pt& a) const { return pt(x - a.x, y - a.y, z - a.z); }
  pt operator+(const pt& a) const { return pt(x + a.x, y + a.y, z + a.z); }
  pt operator*(const double a) const { return pt(x * a, y * a, z * a); }
  void read() { scanf("%lf%lf%lf", &x, &y, &z); }
  double len() { return sqrt(x * x + y * y + z * z); }
  void write() { printf("(%.2f %.2f %.2f)\n", x, y, z); }
  pt unit() {
    double l = len();
    return pt(x / l, y / l, z / l);
  }
  pt trunc(double s) {
    double l = len();
    return pt(x * s / l, y * s / l, z * s / l);
  }
};
double sqr(double x) { return x * x; }
pt det(pt a, pt b) {
  return pt(a.y * b.z - a.z * b.y, a.z * b.x - a.x * b.z,
            a.x * b.y - a.y * b.x);
}
double dot(pt a, pt b) { return a.x * b.x + a.y * b.y + a.z * b.z; }
double dis2(pt a, pt b) {
  return sqr(a.x - b.x) + sqr(a.y - b.y) + sqr(a.z - b.z);
}
double dis(pt a, pt b) { return sqrt(dis2(a, b)); }
void Assert(int x) {
  if (!x)
    while (1) puts("omg");
}
const int V = 110;
pt center, dir;
pt sphere[V];
double r[V];
vector<pt> p[V];
double R;
int n;
double ans;
double dis_to_line(pt o, pt a, pt b) {
  if (sgn(dot(o - a, b - a)) < 0) return dis(o, a);
  return det(o - a, o - b).len() / dis(a, b);
}
pt cross_point(pt a, pt b, pt c, pt d) {
  Assert(sgn(det(c - a, c - b).len() + det(d - a, d - b).len()) != 0);
  pt norm = det(c - a, c - b).unit();
  Assert(sgn(dot(d - a, norm)) == 0);
  double ratio =
      det(c - a, c - b).len() / (det(c - a, c - b) + det(d - b, d - a)).len();
  return c + (d - c) * ratio;
}
void intersect_sphere_line(pt o, double r, pt a, pt b) {
  double d = dis_to_line(o, a, b);
  if (sgn(d - r) > 0) return;
  pt c1;
  if (sgn(det(o - a, b - a).len()) == 0) {
    c1 = o - (b - a).trunc(r);
    ans = min(ans, dis(a, c1));
    return;
  }
  pt norm = det(o - a, b - a).unit();
  pt per = det(norm, b - a).unit();
  pt mid = cross_point(a, b, o, o + per);
  if (sgn(det(mid - a, mid - b).len()) != 0) {
    det(mid - a, mid - b).write();
  }
  d = sqrt(r * r - dis2(o, mid));
  c1 = mid - (b - a).trunc(d);
  if (sgn(dis(c1, o) - r) != 0) {
    Assert(0);
  }
  if (sgn(det(c1 - a, c1 - b).len()) != 0) {
    Assert(0);
  }
  ans = min(ans, dis(a, c1));
}
void solve(int id) {
  pt o = sphere[id];
  intersect_sphere_line(o, R + r[id], center, center + dir.unit());
  for (int i = 0; i < p[id].size(); ++i)
    intersect_sphere_line(o + p[id][i], R, center, center + dir.unit());
}
int main() {
  int tmp;
  center.read();
  dir.read();
  cin >> R;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    sphere[i].read();
    scanf("%lf%d", &r[i], &tmp);
    p[i].resize(tmp);
    for (int j = 0; j < tmp; ++j) p[i][j].read();
  }
  ans = 1e10;
  for (int i = 0; i < n; ++i) solve(i);
  if (ans == 1e10)
    printf("-1\n");
  else
    printf("%.10f\n", ans / dir.len());
}