Problem: Dima is living in a dormitory, as well as some cockroaches.

At the moment 0 Dima saw a cockroach running on a table and decided to kill it. Dima needs exactly T seconds for aiming, and after that he will precisely strike the cockroach and finish it.

To survive the cockroach has to run into a shadow, cast by round plates standing on the table, in T seconds. Shadow casted by any of the plates has the shape of a circle. Shadow circles may intersect, nest or overlap arbitrarily.

The cockroach uses the following strategy: first he equiprobably picks a direction to run towards and then runs towards it with the constant speed v. If at some moment t ≤ T it reaches any shadow circle, it immediately stops in the shadow and thus will stay alive. Otherwise the cockroach is killed by the Dima's precise strike. Consider that the Dima's precise strike is instant.

Determine the probability of that the cockroach will stay alive.

Input

In the first line of the input the four integers x0, y0, v, T (|x0|, |y0| ≤ 109, 0 ≤ v, T ≤ 109) are given — the cockroach initial position on the table in the Cartesian system at the moment 0, the cockroach's constant speed and the time in seconds Dima needs for aiming respectively.

In the next line the only number n (1 ≤ n ≤ 100 000) is given — the number of shadow circles casted by plates.

In the next n lines shadow circle description is given: the ith of them consists of three integers xi, yi, ri (|xi|, |yi| ≤ 109, 0 ≤ r ≤ 109) — the ith shadow circle on-table position in the Cartesian system and its radius respectively.

Consider that the table is big enough for the cockroach not to run to the table edges and avoid Dima's precise strike.

Output

Print the only real number p — the probability of that the cockroach will stay alive.

Your answer will be considered correct if its absolute or relative error does not exceed 10 - 4.

Examples

Input

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


Output

0.50000000000

Input

0 0 1 0
1
1 0 1


Output

1.00000000000

Note

The picture for the first sample is given below. 

<image>

Red color stands for points which being chosen as the cockroach's running direction will cause him being killed, green color for those standing for survival directions. Please note that despite containing a circle centered in ( - 2, 2) a part of zone is colored red because the cockroach is not able to reach it in one second.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
const long double PI = acos(-1.0);
struct Point {
  int x, y;
  bool read() {
    if (scanf("%d%d", &x, &y) < 2) {
      return false;
    }
    return true;
  }
  long long sq_dist(const Point& p) const {
    return (x - p.x) * 1ll * (x - p.x) + (y - p.y) * 1ll * (y - p.y);
  }
};
struct Circle {
  Point p;
  int r;
  bool read() {
    if (!p.read()) {
      return false;
    }
    scanf("%d", &r);
    return true;
  }
  bool contains(const Point& q) { return p.sq_dist(q) <= r * 1ll * r; }
  long double ang(const Point& p0) const {
    long double a = atan2(p.y - p0.y, p.x - p0.x);
    if (a < 0) {
      a += 2 * PI;
    }
    return a;
  }
};
vector<Circle> cs;
int n;
Point p0;
int v, T;
bool read() {
  if (!p0.read()) {
    return false;
  }
  scanf("%d%d", &v, &T);
  scanf("%d", &n);
  cs.resize(n);
  for (int i = 0; i < (int)n; ++i) {
    cs[i].read();
  }
  return true;
}
long double solve() {
  for (int i = 0; i < (int)((int)(cs).size()); ++i) {
    if (cs[i].contains(p0)) {
      return 1;
    }
  }
  vector<pair<long double, long double>> segs;
  for (int i = 0; i < (int)((int)(cs).size()); ++i) {
    if (cs[i].r == 0) {
      continue;
    }
    long double ang = cs[i].ang(p0);
    long double D = sqrtl(cs[i].p.sq_dist(p0));
    long double x = cs[i].r / D;
    if (x < 0) x = 0;
    if (x > 1) x = 1;
    long double a = asin(x);
    long double l = 0;
    long double r = a;
    for (int it = 0; it < (int)50; ++it) {
      long double m = (l + r) * 0.5;
      long double sin_beta = D * sin(m) / cs[i].r;
      long double cos_beta = sqrtl(1.0 - sin_beta * sin_beta);
      long double z = D * cosl(m) - cos_beta * cs[i].r;
      if (z < v * 1ll * T) {
        l = m;
      } else {
        r = m;
      }
    }
    long double diff = l;
    l = ang - diff;
    r = ang + diff;
    if (l < 0) {
      l += 2 * PI;
      r += 2 * PI;
    }
    if (r > 2 * PI) {
      segs.push_back(make_pair(l, 2 * PI));
      segs.push_back(make_pair(0, r - 2 * PI));
    } else {
      segs.push_back(make_pair(l, r));
    }
  }
  long double sum = 0;
  sort(begin(segs), end(segs));
  long double r = 0;
  for (auto s : segs) {
    sum += max((long double)0.0, s.first - r);
    r = max(r, s.second);
  }
  sum += 2 * PI - r;
  return 1.0 - sum / (2 * PI);
}
int main() {
  while (read()) {
    printf("%.10f\n", (double)solve());
  }
  return 0;
}