#include <bits/stdc++.h>

using namespace std;

using i64 = long long;  
using i128 = __int128;

struct Point{
    i64 x, y;
};

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

i64 dot(const Point &a, const Point &b){
    return a.x * b.x + a.y * b.y;
}

i64 mul(const Point &a){
    return a.x * a.x + a.y * a.y;
}

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

void solve(){
    int n;
    cin >> n;

    Point o;
    i64 r;
    cin >> o.x >> o.y >> r;

    vector<Point>p(n);
    for (int i = 0;i < n;i ++){
        cin >> p[i].x >> p[i].y;
    }

    i64 ans = 0;
    auto work = [&](int x){
        i64 res = 0;
        for (int l = 0, r = l + 1;l < n;l ++){
            while (1){
                int rr = r % n + 1;
                i64 s = cross(p[rr] - p[l], o - p[l]);
                if (x == 1){
                    if (s <= 0) break;
                }else{
                    if (s >= 0) break;
                }
                if (s * s < mul(p[rr] - p[l]) * r * r){
                    break;
                }

                res += cross(p[r] - p[l], p[rr] - p[l]);
                r = rr;
            }
            ans = max(ans, abs(res));
            // cerr << l << " " << r << " " << res << " " << ans << "\n";
            int ll = l % n + 1;
            res -= cross(p[r] - p[l], p[r] - p[ll]);
        }
    };   
    work(1);
    reverse(p.begin(), p.end());
    work(0);

    cout << ans << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T;
    cin >> T;
    while (T --){
        solve();
    }

    return 0;
}