#include <bits/stdc++.h>
using namespace std;

#define int long long
using i64 = long long;

struct Point {
    int x, y;
    Point(int x_ = 0, int y_ = 0): x(x_), y(y_) {}
    friend Point operator + (Point a, Point b) {
        return Point(a.x + b.x, a.y + b.y);
    }
    friend Point operator - (Point a, Point b) {
        return Point(a.x - b.x, a.y - b.y);
    }
};

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

int det(Point a, Point b) {
    return a.x * b.y - a.y * b.x;
}

int dis(Point v) {
    return v.x * v.x + v.y * v.y;
}

int sign(int x) {
    if (x == 0) {
        return 0;
    }
    if (x < 0) {
        return -1;
    }
    return 1;
}

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

    Point p;
    int r1;
    {
        auto &[x, y] = p;
        std::cin >> x >> y >> r1;
    }
    
    std::vector<Point> ps(n + 1);

    for (int i = 1; i <= n; i++) {
        auto &[x, y] = ps[i];
        std::cin >> x >> y;
    }

    auto nxt = [&](int x)-> int {
        if (x == n) {
            return 1;
        }
        return x + 1;
    };

    auto pre = [&](int x)-> int {
        if (x == 1) {
            return n;
        }
        return x - 1;
    };

    int sum = 0, ma = 0;

    for (int L = 1, R = 2; L <= n; L ++) {
        if (L != 1) {
            sum -= std::abs(det(ps[pre(L)] - ps[L], ps[R] - ps[L]));
            ma = std::max(ma, sum);
        }
        int is = sign(det(p - ps[L], ps[nxt(L)] - ps[L]));
        int r = R;
        while (true) {
            if (L == R) {
                R = nxt(R);
                r = R;
                continue;
            }
            int S = det(p - ps[L], ps[R] - ps[L]);
            if (sign(S) != is) {
                break;
            }
            S = S * S;
            int D = dis(ps[L] - ps[R]);
            if (S < r1 * r1 * D) {
                break;
            }
            if (R != r) sum += std::abs(det(ps[R] - ps[L], ps[pre(R)] - ps[L]));
            // std::cout << "Sum = " << L << ' ' << R << ' ' << sum << '\n';
            ma = std::max(ma, sum);
            r = R;
            R = nxt(R);
        }   
        R = r;
        // std::cout << L << ' ' << r << ' ' << ma << '\n';
    }

    std::cout << ma << '\n';
}

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

    int t = 1;
    std::cin >> t;
    while (t --) {
        solve();
    }
}