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

const ll INF = 1e18;
const long double EPS = 1e-8;
struct P
{
    ll x, y;

    P(): x(0), y(0) {}
    P(ll x, ll y): x(x), y(y) {}

    P operator-(const P& rhs) const { return P(x - rhs.x, y - rhs.y); }
    P operator+(const P& rhs) const { return P(x + rhs.x, y + rhs.y); }
    ll operator*(const P& rhs) const { return x * rhs.x + y * rhs.y; }
    ll len2() { return *this * *this; }
};

ll sqr(ll x) { return x * x; }
ll dis2(const P& p1, const P& p2) { return (p1 - p2).len2(); }
ll cross(const P& p1, const P& p2) { return p1.x * p2.y - p2.x * p1.y; }

ll area(const P& p1, const P& p2, const P& p3) { return fabsl(cross(p2 - p1, p3 - p1)); }

void solve()
{
    ll n, R;
    P c;
    cin >> n >> c.x >> c.y >> R;
    vector<P> p(n);
    for (int i = 0; i < n; ++i) cin >> p[i].x >> p[i].y;
    auto check = [&](int l, int r) { return area(p[l], p[r], c) / sqrtl(dis2(p[l], p[r])) > R - EPS; };
    ll res = 0, ans = 0;
    for (int l = 0, r = 1; l < n; ++l)
    {
        while (check(l, (r + 1) % n) && cross(p[(r + 1) % n] - p[l], c - p[l]) > 0)
        {
            res += area(p[l], p[r % n], p[(r + 1) % n]);
            r++;
        }
        ans = max(ans, res);
        res -= area(p[l], p[(l + 1) % n], p[r % n]);
    }
    cout << ans << '\n';
    return;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    cin >> T;
    while (T--) solve();
    return 0;
}