#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
struct point {
    double x, y;
};

signed main() {
    cin.tie(0) -> sync_with_stdio(0);

    int n;
    double x0, y0, d, t;
    cin >> n >> x0 >> y0 >> d >> t;

    vector<point> a(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> a[i].x >> a[i].y;
    }

    double mx = 0, mi = 1e9;
    const double PI = acos((double)(-1));
    auto get = [&](double k, point a) -> double {
        double theta = atan(k);
        if (theta < 0) theta = PI / 2 - theta;

        if (theta < PI / 2 && a.x < 0) {
            theta += PI;
        } 
        if (theta > PI / 2 && a.x > 0) {
            theta += PI;
        }
        return theta;
    };

    for (int i = 1; i <= n; i++) {
        auto [x, y] = a[i];
        if (x == d) {
            mx = max(mx, max(PI / 2 + (a[i].y < 0 ? PI : 0), get((y * y - d * d) / (2 * x * y), a[i])));
            mi = min(mi, min(PI / 2 + (a[i].y < 0 ? PI : 0), get((y * y - d * d) / (2 * x * y), a[i])));
        } else {
            double delta = 4 * x * x * y * y - 4 * (d * d - x * x) * (d * d - y * y);
            double k1 = (-2 * x * y + sqrt(delta)) / 2 / (d * d - x * x);
            double k2 = (-2 * x * y - sqrt(delta)) / 2 / (d * d - x * x);
            mx = max({mx, get(k1, a[i]), get(k2, a[i])});
            mi = min({mi, get(k1, a[i]), get(k2, a[i])});
        }
    }

    auto get_ans = [&](double t) -> double {
        double cnt = floor(t / (2 * PI)), res = 0;
        t -= cnt * 2 * PI;
        if (mx - mi > PI) {
            res += cnt * (2 * PI - mx + mi);
            res += min(mi, t);
        } else {
            res += cnt * (mx - mi);
            res += max<double>(0, min(mx, t) - mi);
        }

        return res;
    };
    if (t ==10000) cout << get_ans(atan2(y0, x0) + t) << " " <<  mx << " " << mi << "\n";
    cout << fixed << setprecision(20) << get_ans(atan2(y0, x0) + t) - get_ans(atan2(y0, x0)) << "\n";
}