#include <bits/stdc++.h>

#define lif " \n"
#define dbg(a) cout << #a << '=' << a << lif[1]
#define inf 0x3f3f3f3f
#define fi first
#define se second
#define cc(x) cout << fixed << setprecision(x);

using namespace std;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128;
using pii = pair<int, int>;
using pll = pair<i64, i64>;
using ld = long double;

const ld PI = acos(-1);
const ld EPS = 1e-7;
const ld INF = 1E18;

i64 cross(pii a, pii b, pii c) {
    return (b.fi - a.fi) * (c.se - a.se) - (b.se - a.se) * (c.fi - a.fi);
}

i64 dtwo(i64 a, i64 b) {
    return a * a + b * b;
}

void solve() {
    int n;
    cin >> n;
    int x, y, r;
    cin >> x >> y >> r;
    vector<pll> a(n);
    for (int i = 0; i < n; i++) cin >> a[i].fi >> a[i].se;
    i64 ans = 0, s = 0;
    for (int l = 0, r = l + 1; l < n; l++) {
        if (l == r) r = (l + 1) % n;
        while (1) {
            int t = (r + 1) % n;
            i64 ts = cross(a[l], a[t], {x, y});
            // cerr << l << ' ' << r << ' ' << t << ' ' << ts << lif[1];
            
            if (ts <= 0) break;
            if ((i128)ts * ts < (i128)r * r * dtwo(a[t].fi - a[l].fi, a[t].se - a[l].se)) break;

            i64 tmp = cross(a[l], a[r], a[t]);
            // cerr << tmp << lif[1];
            s += tmp;
            r = t;
        }
        // cerr << l << ' ' << r << ' ' << s << lif[1];
        ans = max(ans, s);
        s -= cross(a[l], a[(l + 1) % n], a[r]);

    }
    cout << ans << lif[1];
}

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