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

#define int long long
#define double long double

const int N = 1e6 + 7;
const int INF = 0x3f3f3f3f3f3f3f3f;

struct Point {
    int x, y;

}pts[100007], cir;
int r;
int cross(Point p1, Point p2, Point p3) {
    return (p1.x - p3.x) * (p2.y - p3.y) - (p2.x - p3.x) * (p1.y - p3.y);
}
struct Line {
    Point s, e;
    int a, b, c;
    Line(Point s, Point e) :s(s), e(e) { exchange(); };
    void exchange() {
        a = s.y - e.y;
        b = e.x - s.x;
        c = s.x * e.y - s.y * e.x;
    }
};
bool check(Point p, Point s, Point e, int r) {
    Line l(s, e);
    return (l.a * p.x + l.b * p.y + l.c) * ((l.a * p.x + l.b * p.y + l.c)) >= r * r * (l.a * l.a + l.b * l.b);
}
int rotate(Point* pts, int n) {
    int p = 0;
    int ans = 0, dif = 0;
    pts[n] = pts[0];
    for (int i = 0;i < n;i++) {
        dif -= abs(cross(pts[i], pts[(i - 1 + n) % n], pts[p]));
        while (abs(cross(pts[i], pts[i + 1], pts[p + 1])) >= abs(cross(pts[i], pts[i + 1], pts[p])) && cross(pts[p], cir, pts[i]) * cross(pts[p + 1], cir, pts[i]) >= 0 && check(cir, pts[i], pts[p + 1], r)) {
            dif += abs(cross(pts[p], pts[p + 1], pts[i]));
            p = (p + 1) % n;
        }
        ans = max(ans, dif);
    }
    return ans;
}
void solve() {
    int n;
    cin >> n;
    cin >> cir.x >> cir.y >> r;
    for (int i = 0;i < n;i++) cin >> pts[i].x >> pts[i].y;
    cout << rotate(pts, n) << '\n';
}

signed main() {
    ios::sync_with_stdio(false), cin.tie(0);
    int _ = 1;
    cin >> _;
    while (_--) solve();
}