#include<bits/stdc++.h>
#define int long long
#define pll pair<int,int>

using namespace std;
const int N = 705;
int gcd(int a, int b) {
	if (b)return gcd(b, a % b);
	else return a;
}
int pf(int x) { return x * x; }
struct Point {
	int x, y;
	Point() {};
	Point(int x, int y) :x(x), y(y) {};
	Point operator-(Point B) { return Point(x - B.x, y - B.y); }
	Point operator+(Point B) { return Point(x + B.x, y + B.y); }
	Point operator/(int k) { return Point(x / k, y / k); }
	Point operator*(int k) { return Point(x * k, y * k); }
	bool operator==(Point B) { return x == B.x && y == B.y; }
	bool operator<(const Point& B)const { return (x == B.x ? y < B.y : x < B.x); }
};
int Cross(Point A, Point B) { return A.x * B.y - A.y * B.x; }
int Dot(Point A, Point B) { return A.x * B.x + A.y * B.y; }
//lf dis(Point a, Point b) { return sqrt(pf(a.x - b.x) + pf(a.y - b.y)); }
struct Line {
	Point point, vec;//点向式
	Line(Point A, Point B) {
		vec = A - B;
		int g = gcd(vec.x, vec.y);
		vec = vec / g;
		if (vec.x < 0)vec = vec * -1;
		if (vec.x = 0)point = Point(0, A.y);
		else if (vec.y = 0)point = Point(A.x, 0);
		else {
			int add = A.x / vec.x;
			A.x -= add * vec.x;
			A.y -= add * vec.y;
		}
	};
	bool operator<(const Line& b)const {
		return vec.x * b.vec.x < vec.y* b.vec.y;
	}
};
void read(Point& a) { cin >> a.x >> a.y; }
Point a[N];
struct Circle {
	Point c;
	int r;
	int cross(Point A, Point B) {
		int S = abs(Cross(c - A, B - A));
		if (S * S >= r * r*(pf(A.x - B.x)+pf(A.y - B.y)))return 0;
		else return 1;
	}
};
void solve() {
	int n;
	cin >> n;
	Circle c;
	read(c.c);
	cin >> c.r;
	for (int i = 1; i <= n; i++) {
		read(a[i]);
	}
	int p = 1;
	int now = 0, ans = 0;
	for (int i = 1; i <= n; i++) {
		while (c.cross(a[i], a[p % n + 1]) == 0&&Cross(a[p % n + 1]-a[i],c.c-a[i])>=0) {
			now = now + abs(Cross(a[p % n + 1] - a[i], a[p] - a[i]));
			ans = max(ans, now);
			p = p % n + 1;
		}
		ans = max(ans, now);
		now=now- abs(Cross(a[i % n + 1] - a[p], a[i] - a[p]));
	}
	cout << ans << '\n';
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t;
	cin >> t;
	while (t--)
	solve();
	return 0;
}