#include <bits/stdc++.h>
using namespace std;

double EPS = 1e-10;

template <class T> int sgn(T x) { return (x > 0) - (x < 0); }
template<class T>
struct Point {
	typedef Point P;
	T x, y;
	explicit Point(T x=0, T y=0) : x(x), y(y) {}
	bool operator<(P p) const { return tie(x,y) < tie(p.x,p.y); }
	bool operator==(P p) const { return tie(x,y)==tie(p.x,p.y); }
	P operator+(P p) const { return P(x+p.x, y+p.y); }
	P operator-(P p) const { return P(x-p.x, y-p.y); }
	P operator*(T d) const { return P(x*d, y*d); }
	P operator/(T d) const { return P(x/d, y/d); }
	T dot(P p) const { return x*p.x + y*p.y; }
	T cross(P p) const { return x*p.y - y*p.x; }
	T cross(P a, P b) const { return (a-*this).cross(b-*this); }
	T dist2() const { return x*x + y*y; }
	double dist() const { return sqrt((double)dist2()); }
	// angle to x-axis in interval [-pi, pi]
	double angle() const { return atan2(y, x); }
	P unit() const { return *this/dist(); } // makes dist()=1
	P perp() const { return P(-y, x); } // rotates +90 degrees
	P normal() const { return perp().unit(); }
	// returns point rotated 'a' radians ccw around the origin
	P rotate(double a) const {
		return P(x*cos(a)-y*sin(a),x*sin(a)+y*cos(a)); }
	friend ostream& operator<<(ostream& os, P p) {
		return os << "(" << p.x << "," << p.y << ")"; }
};

typedef Point<long long> P;
double segDist(P& s, P& e, P& p) {
	if (s==e) return (p-s).dist();
	auto d = (e-s).dist2(), t = min(d, max((long long) 0, (p-s).dot(e-s)));
	return ((p-s)*d-(e-s)*t).dist()/d;
}

long long area_sum(vector<P> &polygon, vector<__int128_t> &psum, int x, int y) {
    if (x < y) {
        return (long long) (psum[y - 1] - (x > 0 ? psum[x - 1] : 0) + polygon[y].cross(polygon[x]));
    }
    return (long long) ((psum[psum.size() - 1] - psum[x - 1]) + (y > 0 ? psum[y - 1] : 0) + polygon[y].cross(polygon[x]));
}

int orientation(P &a, P &b, P &c) {
    __int128_t val = (b.y - a.y) * (c.x - b.x) - (b.x - a.x) * (c.y - b.y);
    if (val == 0) {
        return 0;
    }
    return (val > 0) ? -1 : 1;
}

void solve() {
    int n;
    cin >> n;
    P center;
    long long rad;
    cin >> center.x >> center.y >> rad;

    vector<P> polygon(n);
    for (int i = 0; i < n; i++) {
        cin >> polygon[i].x >> polygon[i].y;
    }

    vector<long long> areas(n);
    vector<__int128_t> psum(n);
    for (int i = 0; i < n; i++) {
        areas[i] = polygon[i].cross(polygon[(i + 1) % n]);
        psum[i] = (i > 0 ? psum[i - 1] : 0) + areas[i];
    }
    
    long long res = 0;
    for (int i = 0; i < n; i++) {
        int l = 2;
        int r = n - 2;
        int best = -1;
        while (l <= r) {
            int m = (l + r) / 2;
            if (orientation(polygon[i], polygon[(i + m) % n], center) <= 0) {
                r = m - 1;
                continue;
            }
            double cur_dist = segDist(polygon[i], polygon[(i + m) % n], center);
            if (cur_dist >= rad - EPS) {
                best = m;
                l = m + 1;
            } else {
                r = m - 1;
            }
        }
        if (best != -1) {
            long long cur_area = area_sum(polygon, psum, i, (i + best) % n);
            res = max(res, cur_area);
        }
    }
    cout << res << "\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}