#include <bits/stdc++.h>
#define rep(i, a, b) for(int i = (int)a; i <= (int)b; i ++)
#define per(i, a, b) for(int i = (int)a; i >= (int)b; i --)
#define ll long long
using namespace std;
struct Point {
    ll x, y;
    Point() {}
    Point(ll a, ll b) { x = a, y = b; }
} ;
Point operator - (Point a, Point b) { return Point(a.x - b.x, a.y - b.y); }
double cross(Point a, Point b) { return a.x * b.y - a.y * b.x; }
double dis(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;
    Point C;
    cin >> C.x >> C.y;
    double R;
    cin >> R;
    vector < Point > a(n);
    rep(i, 0, n - 1) cin >> a[i].x >> a[i].y;
    double res = 0, s = 0;
    for(int l = 0, r = l + 1; l < n; l ++) {
        while(1) {
            int rr = (r + 1) % n;
            double sgn = cross(C - a[l], a[rr] - a[l]);
            if(sgn >= 0) break;
            // cerr << sgn << endl;
            // cerr << dis(a[l], a[rr]) * R << endl;
            __int128 tmp = sgn;
            tmp = tmp * tmp;
            __int128 tmp2 = dis(a[l], a[rr]);
            tmp2 *= R * R;
            if(tmp < tmp2) break;
            s += cross(a[r] - a[l], a[rr] - a[l]);
            r = rr;
        }
        // cerr << "l : " << l << " r : " << r << endl;
        res = max(res, s);
        int lnxt = (l + 1) % n;
        s -= cross(a[lnxt] - a[l], a[r] - a[l]);
    }
    cout << (long long)res << '\n';
}
int main() {
#ifdef LOCAL
    freopen("data.in", "r", stdin);
#endif
    ios :: sync_with_stdio(false);
    cin.tie(0);
    int T;
    cin >> T;
    cout << fixed << setprecision(10);
    while(T --) solve();
    return 0;
}