#include<bits/stdc++.h>
#define int long long
using namespace std;
const double PI = acos(-1);
const double eps = 1e-8;
struct point
{
    double x, y;
};

double sign(double a)
{
    if(fabs(a) < eps)
        return 0;
    if(a < 0)
        return -1;
    return 1;
}

point operator- (point a, point b)
{
    return {a.x - b.x, a.y - b.y};
}

point operator/ (point a, double b)
{
    return {a.x / b, a.y / b};
}

point operator* (point a, double b)
{
    return {a.x * b, a.y * b};
}

point rotate(point a, double b)
{
    return {a.x * cos(b) + a.y * sin(b), -a.x * sin(b) + a.y * cos(b)};
}

double cross(point a, point b)
{
    return a.x * b.y - a.y * b.x;
}

double get_dist(point a, point b)
{
    double dx = a.x - b.x;
    double dy = a.y - b.y;
    return sqrt(dx * dx + dy * dy);
}

void solve()
{
    point O = {0, 0};
    double n, d, t;
    point v0;
    cin >> n >> v0.x >> v0.y >> d >> t;
    vector<point> a(n + 1);
    for(int i = 1; i <= n; i ++)
    {
        int x, y; 
        cin >> x >> y;
        a[i] = (point){x, y};
    }
    
    double l, r;
    l = atan2(v0.y, v0.x);
    if(l < 0)
        l += PI * 2;
    r = l + PI * 2;
    point vl = v0;
    while(r - l > eps)
    {
        double mid = (l + r) / 2;
        point v = rotate(vl, l - mid);
        point p = rotate(v, -PI / 2) / get_dist(O, v) * d;
        bool flag = false;
        for(int i = 1; i <= n; i ++)
        {
            if(sign(cross(v, a[i] - p)) < 0)
                flag = true;
        }
        if(flag)
            r = mid;
        else
        {
            l = mid;
            vl = v;
        }
    }
    double st_angle = l;
    // cerr << l << endl;

    l = atan2(v0.y, v0.x);
    // cerr << l << endl;
    if(l < 0)
        l += PI * 2;
    r = l + PI * 2;
    vl = v0;
    while(r - l > eps)
    {
        double mid = (l + r) / 2;
        // cerr << mid << endl;
        point v = rotate(vl, l - mid);
        point p = rotate(v, PI / 2) / get_dist(O, v) * d;
        // cerr << p.x << ' ' << p.y << endl;
        bool flag = false;
        int num = 0;
        for(int i = 1; i <= n; i ++)
        {
            if(sign(cross(v, a[i] - p)) > 0)
                flag = true;
        }
        if(flag)
        {
            l = mid;
            vl = v;
        }
        else
            r = mid;
    }
    double ed_angle = l;
    // cerr << l << endl;

    int cnt = t / (PI * 2);
    t -= cnt * PI * 2;

    double v0_angle = atan2(v0.y, v0.x);
    if(v0_angle < 0)
        v0_angle += PI * 2;
    double v1_angle = v0_angle + t;
    
    double ans = max(0.0, min(ed_angle, v1_angle) - max(st_angle, v0_angle)) + cnt * (ed_angle - st_angle);
    printf("%.7lf\n", ans);
}
signed main()
{
    int T = 1;
    while (T --) solve();
    return 0;
}