#include <bits/stdc++.h>
using LL = long long;
using i128 = __int128;

const int maxN = 2e5 + 10;
int T, n;
LL x, y, R;
struct Point {
	LL x, y;
} p[maxN];

Point operator - (Point p1, Point p2) {
	Point u; 
	u.x = p1.x - p2.x;
	u.y = p1.y - p2.y;
	return u;
}
LL cross(Point v1, Point v2) {
	return v1.x * v2.y - v1.y * v2.x;
}

bool check(Point p1, Point p2, Point O, LL R) {
	i128 A = p1.y - p2.y, B = p2.x - p1.x, C = p1.x * p2.y - p1.y * p2.x;
	i128 D = (i128) (A * O.x + B * O.y + C); 
	D = D * D;
	i128 E = (i128) (A * A + B * B) * R * R;
	return (D >= E);
}
int main() {
	std::ios::sync_with_stdio(false); std::cin.tie(nullptr);
	std::cin >> T;
	while(T--) {
		Point O;
		std::cin >> n >> O.x >> O.y >> R;
		for(int i = 1; i <= n; i++) {
			std::cin >> p[i].x >> p[i].y;
		}

		for(int i = n + 1; i <= 2 * n; i++) {
			p[i] = p[i - n];
		}

		LL ans = 0, cur = 0;
		int j = 1;
		for(int i = 1; i <= n; i++) {
			while(cross(p[j + 1] - p[i], O - p[i]) >= 0 && check(p[i], p[j + 1], O, R)) {
				cur += abs(cross(p[j] - p[i], p[j + 1] - p[i]));
				j++;
			}
			// std::cout << i << ' ' << j << " " << cur << "\n";
			ans = std::max(ans, cur);
			cur -= abs(cross(p[i + 1] - p[i], p[j] - p[i]));
		}

		std::cout << ans << "\n";

		for(int i = 1; i <= 2 * n; i++) {
			p[i].x = 0; p[i].y = 0;
		}
	}
	return 0;
}