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

#define ll long long 
#define INF 0x3f3f3f3f
#define LNF 0x3f3f3f3f3f3f3f3fll
#define MOD 998244353
#define pii pair<int, int>

struct Point {
    ll x, y;

    Point() {};
    Point(int x, int y): x(x), y(y) {};

    Point operator+ (const Point& p) const {
        return Point(x + p.x, y + p.y);
    }

    Point operator- (const Point& p) const {
        return Point(x - p.x, y - p.y);
    }

    ll operator* (const Point& p) const {
        return x * p.y - y * p.x;
    }

    ll operator/ (const Point& p) const {
        return x * p.x + y * p.y;
    }
};

bool circle_line_intersect(Point c, ll r, Point la, Point lb) {
    Point l = la - lb;
    if (l.x == 0 && l.y == 0) return 0;
    Point rl = Point(-l.y, l.x);

    return abs((la - c) / rl) <= r * sqrt(rl / rl);
}

bool point_in_triangle(Point a, Point b, Point c, Point x) {
    if ((b - a) * (c - a) == 0) return 0;
    if ((a - b) * (c - b) == 0) return 0;
    if ((a - c) * (b - c) == 0) return 0;

    ll s0 = (b - a) * (x - a);
    ll s1 = (c - b) * (x - b);
    ll s2 = (a - c) * (x - c);

    bool has_neg = (s0 < 0) || (s1 < 0) || (s2 < 0);
    bool has_pos = (s0 > 0) || (s1 > 0) || (s2 > 0);

    return !(has_neg && has_pos);
}

int main() {
#ifdef TEST
    freopen("zz.in", "r+", stdin);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t; cin >> t;
    while (t --) {
        int n; cin >> n;

        vector<Point> conv(n);
        Point c;
        int r;

        cin >> c.x >> c.y >> r;
        for (int i = 0; i < n; ++ i) cin >> conv[i].x >> conv[i].y;

        ll res = 0;
        
        ll area = 0; 
        for (int i = 0, j = -1; i < n; ++ i) {
            if (area == 0) j = (i + 1) % n;
            while (j != (i+1)%n && !circle_line_intersect(c, r, conv[i], conv[j]) && (j <= i+1 || !point_in_triangle(conv[i], conv[j-1], conv[j], c))) {
                if (j > i+1) {
                    area += (conv[(j+n-1)%n] - conv[i]) * (conv[j] - conv[i]);
                }
                j = (j + 1) % n;
            }

            res = max(res, area);
            if (j - i >= 3) area -= (conv[i+1] - conv[i]) * (conv[j-1] - conv[i]);
        }

        cout << res << '\n';
    }
}