#define LOCAL
#include <bits/stdc++.h>
#define fir first
#define sec second
#define el '\n'

#ifdef LOCAL
#define FINISH cerr << "FINISH" << endl;
#else
#define FINISH ;
#endif

#ifdef LOCAL
#define debug(x) cerr << setw(4) << #x << " == " << x << endl
#else
#define debug(x)
#endif

#ifdef LOCAL
#define debugv(x)                   \
	cerr << setw(4) << #x << ":: "; \
	for (auto i : x)                \
		cerr << i << " ";           \
	cerr << endl
#else
#define debugv(x)
#endif

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ld, ld> PII;
ostream &operator<<(ostream &out, PII &x)
{
	out << x.fir << " " << x.sec << endl;
	return out;
}

const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const int N = 200020;
const ld eps = 1e-14;
struct point {
	ld x, y;
	point operator+(const point &a) const
	{
		return {x + a.x, y + a.y};
	}
	point operator-(const point &a) const
	{
		return {x - a.x, y - a.y};
	}
	ld operator*(const point &a) const
	{
		return {x * a.x + y * a.y};
	}
	ld operator^(const point &a) const
	{
		return {x * a.y - y * a.x};
	}  // 注意优先级
	int toleft(const point &a) const
	{
		const auto t = (*this) ^ a;
		return (t > eps) - (t < -eps);
	}
	long double len2() const
	{
		return (*this) * (*this);
	}
	long double len() const
	{
		return sqrtl(len2());
	}
	long double angle(const point &a) const
	{
		return acosl(max(-1.0l, min(1.0l, ((*this) * a) / (len() * a.len()))));
	}
};
const ld pi = 3.1415926535897932384626433;
void solve()
{
	int n, x0, y0, d, t, flag = 1;
	cin >> n >> x0 >> y0 >> d >> t;
	if (y0 < 0) {
		flag = -1;
		x0 = -x0, y0 = -y0;
	}
	vector<point> ang;
	auto getang = [&](ld x, ld y) {
		pair<point, point> r;
		ld L = sqrt(x * x + y * y);
		ld Y = d;
		ld X = sqrt(x * x + y * y - d * d);
		ld cosx = X / L, sinx = Y / L;
		r.sec = point(x * cosx - y * sinx, x * sinx + y * cosx);
		r.fir = point(x * cosx + y * sinx, -x * sinx + y * cosx);
		ang.push_back(r.fir);
		ang.push_back(r.sec);
	};
	for (int i = 1; i <= n; i++) {
		ld x, y;
		cin >> x >> y;
		x = flag * x;
		y = flag * y;
		getang(x, y);
	}

	// for (int i = 0; i < ang.size(); i++) {
	// 	cout << ang[i].x << " " << ang[i].y << endl;
	// }

	int l;
	for (int i = 0; i < ang.size(); i++) {
		int flag = 1;
		for (int j = 0; j < ang.size(); j++) {
			// cout << ang[i].toleft(ang[j]) << endl;
			if (ang[i].toleft(ang[j]) == -1) {
				flag = 0;
				break;
			}
		}
		if (flag == 1) {
			l = i;
			break;
		}
	}
	int r;
	for (int i = 0; i < ang.size(); i++) {
		int flag = 1;
		for (int j = 0; j < ang.size(); j++) {
			if (j == i)
				continue;
			if (ang[i].toleft(ang[j]) == 1) {
				flag = 0;
				break;
			}
		}
		if (flag == 1) {
			r = i;
			break;
		}
	}

	/*cout << l << " " << r << endl;
	cout << ang[l].x << " " << ang[l].y << " " << ang[r].x << " " << ang[r].y
		 << endl;*/
	ld a = ang[l].angle(ang[r]);
	ld ans = a * floor(t / pi / 2);
	ld lft = t - floor(t / pi / 2) * pi * 2;

	point st = point(x0, y0);


	ld cosx = x0 / sqrtl(x0 * x0 + y0 * y0);
	ld sinx = y0 / sqrtl(x0 * x0 + y0 * y0);
	ang[l] = point(ang[l].x * cosx + ang[l].y * sinx,
				   -ang[l].x * sinx + ang[l].y * cosx);
	ang[r] = point(ang[r].x * cosx + ang[r].y * sinx,
				   -ang[r].x * sinx + ang[r].y * cosx);


	ld ang1 = ang[l].angle(point(1, 0));
	ld ang2 = ang[r].angle(point(1, 0));

	if (ang[l].y < -eps)
		ang1 = pi * 2 - ang1;
	if (ang[r].y < -eps)
		ang2 = pi * 2 - ang2;
	if (n == 27 && t == 7076) {
		cout << ans << endl;
		cout << lft << " " << ang1 << " " << ang2 << endl;
	}
	if (ang2 < pi && ang1 > pi) {
		if (lft > ang2) {
			ans += ang2;
		}
		if (lft > ang1) {
			ans += lft - ang1;
		}
	}
	else {
		if (lft > ang2) {
			ans += a;
		}
		else if (lft > ang1) {
			ans += lft - ang1;
		}
	}
	cout << fixed << setprecision(12) << ans << endl;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int T = 1;
	// cin >> T;
	while (T--) {
		solve();
	}
	return 0;
}