#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define range(x) (x).begin(), (x).end()
const int dir[][2] = {1, 0, -1, 0, 0, 1, 0, -1};
const __int128_t tag = 1;
#define int long long
struct Point {
    ll x, y;
    Point(ll x, ll y)
        : x(x), y(y)
    {
    }
    Point()
    {
        x = 0, y = 0;
    }

    Point operator-(const Point &b)
    {
        return Point(x - b.x, y - b.y);
    }
};
ll cross(Point a, Point b)
{
    return a.x * b.y - a.y * b.x;
}

ll dst2(Point a, Point b)
{
    return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y);
}
void solve()
{
    int n;
    cin >> n;
    int cx, cy, cr;
    cin >> cx >> cy >> cr;
    Point C(cx, cy);
    vector<Point> v(n);
    for (auto &[x, y] : v) {
        cin >> x >> y;
    }
    // reverse(range(v));

    for (int i = 0; i < n; ++i)
        v.push_back(v[i]);

    ll sum = 0;
    int r = 0;
    ll mx = 0;
    for (int i = 0; i < n; ++i) {
        if (r <= i) {
            r = i + 1;
            sum = -cross(v[r], v[i]);
        }
        Point CX(v[i] - C);
        Point CY(v[r + 1] - C);
        // cout << i << ' ' << r + 1 << ' ' << cross(CX, CY) << '\n';
        while (cross(CX, CY) > 0 && tag * cross(CX, CY) * cross(CX, CY) > tag * cr * cr * dst2(v[i], v[r + 1])) {
            r++;
            CX = Point(v[i] - C);
            CY = Point(v[r + 1] - C);
            sum -= cross(v[r], v[r - 1]);
        }

        // CX = Point(v[i] - C);
        // CY = Point(v[r] - C);
        // cout << i << ' ' << r << ' ' << sum << '\n';
        mx = max(mx, sum - cross(v[i], v[r]));
        sum += cross(v[i + 1], v[i]);
    }

    cout << mx << '\n';
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--)
        solve();
    return 0;
}