#include<cstdio>
#include<algorithm>
#include <vector>
#include <cmath>
#include <cassert>
using namespace std;

using ll = long long;
using ld = long double;

struct Point {
    ll x, y;
    void read() {
        scanf("%lld %lld", &x, &y);
    }

    Point() {}

    Point(Point a, Point b) {
        x = b.x - a.x;
        y = b.y - a.y;
    }
};

using Vec = Point;

ll cha(Vec a, Vec b) {
    return a.x * b.y - b.x * a.y;
}

ld dis(Point a, Point b) {
    ld dx = a.x - b.x;
    ld dy = a.y - b.y;
    return sqrt(dx * dx + dy * dy);
}

void solve() {
    int n;
    scanf("%d", &n);

    ll r; // radius
    Point pina;
    pina.read();
    scanf("%lld", &r);

    auto jiao = [&](Point a, Point b) -> bool {
        ll area = cha(Vec(a, b), Vec(a, pina));
        ld h = static_cast<double>(area) / dis(a, b);
        return abs(h) <= static_cast<double>(r);
    };

    auto invxian = [&](Point a, Point b) -> bool {
        ll t = cha(Vec(a, b), Vec(a, pina));
        return t < 0;
    };


    vector<Point> conv(n);
    for (int i = 0; i < n; ++i) conv[i].read();

    int p = 0, q = 0;
    ll ans = 0, cur = 0;

    while (true) {
        while (true) {
            ans = max(ans, cur);
            int qq = (q + 1) % n;
            if (jiao(conv[p], conv[qq]) || invxian(conv[p], conv[qq])) {
                break;
            } else {
                ll t = cha(Vec(conv[p], conv[q]), Vec(conv[p], conv[qq]));
                assert(t >= 0);
                cur += t;
                q = qq;
            }
        }
        int pp = p + 1;
        if (pp == n) break;
        ll t = cha(Vec(conv[q], conv[p]), Vec(conv[q], conv[pp]));
        assert(t >= 0);
        cur -= t;
        assert(cur >= 0);
        p = pp;
    }

    printf("%lld\n", ans);
}

int main() {
    int t;
    scanf("%d", &t);
    while (t--) {
        solve();
    }
    return 0;
}