#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const char nl = '\n';
#define watch(x) cout << (#x) << ": " << (x) << endl

using pt = complex<ll>;

int dot(pt a, pt b) { // dot product
    return real(conj(a)*b);
}
int cross(pt a, pt b) { // cross product
    return imag(conj(a)*b);
}

bool diff(ll x, ll y) {
    return (x > 0) ^ (y > 0);
}

void solve() {
    int n;
    cin >> n;
    int X, Y, R;
    cin >> X >> Y >> R;
    pt P(X, Y);
    vector<pt> a(n);
    for (int i = 0; i < n; i++) {
        int xx, yy;
        cin >> xx >> yy;
        a[i] = {xx, yy};
    }
    for (int i = 0; i < n; i++) {
        a.push_back(a[i]);
    }
    int l = 0, r = 1;
    ll sz = 0, ans = 0;
    while (l < n) {
        while (r < 2*n-1) {
            pt v1 = P - a[l], v2 = a[r] - a[l], v3 = a[r+1] - a[l];
            if (diff(cross(v1, v2), cross(v1, v3))) break;
            if (cross(v1, v3) * cross(v1, v3) / dot(v3, v3) < R*R) break;
            sz += abs(cross(v2, v3));
            r++;
            // cout << a[l] << ' ' << a[r] << ' ' << sz << endl;
        }
        ans = max(ans, sz);
        sz -= abs(cross(a[l] - a[r], a[l+1] - a[r]));
        l++;
    }
    cout << ans << nl;
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    int t;
    cin >> t;
    for (; t; t--) solve();
    return 0;
}