#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
#define ii pair<int, int>
#define db double
const int N = 3e5+5, M = 1e3+5, MOD = 1e9+7, inf = 1e18, EPS = 1e-15;
int n, m, x, y, res, test, cnt, sum, k, r;
int aa[N];

struct point{
    db x, y;
} a[N], A;

struct pt{
    db a, b, c;  // ax + by + c = 0
};

pt findPt(point a, point b) {
//    if (a.x == b.x) return {1, 0, -a.x};
//    if (a.y == b.y) return {0, 1, -a.y};
//    db a1 = (a.y - b.y) / (a.x - b.x);
//    db b1 = a.y - a1 * a.x;
    return {a.y - b.y, b.x - a.x, a.x * b.y - a.y * b.x};
}

db dist(point x, point A, point B) { // kc tu diem x den AB
    pt dt = findPt(A, B);
    return abs(dt.a * x.x + dt.b * x.y + dt.c) / sqrt(dt.a * dt.a + dt.b * dt.b);
}

db S(point A, point B, point C) { //dien tich tam giac ABC
    return abs((B.x - A.x) * (C.y - A.y) - (C.x - A.x) * (B.y - A.y)) / 2;
}

void sol() {
    cin >> n >> A.x >> A.y >> r;
    for (int i = 1; i <= n; ++i) cin >> a[i].x >> a[i].y;
    db sum = 0;
    for (int i = n - 1; i > 0; --i) {
        db d = dist(A, a[i], a[n]);
        //cout << d << endl;
        if (d - r >= EPS || abs(d - r) <= EPS) {
            k = i;
            if (i + 1 < n) sum += S(a[n], a[i], a[i + 1]);
        }
        else {
            //cout << i + 1 << ' ' << sum * 2 << endl;
            break;
        }
    }
    pt s = findPt(a[1], a[3]);
    //cout << s.a << ' ' << fixed << setprecision(0) << s.c << endl;
//    db d = dist(A, a[1], a[n]);
//        cout << d << endl;
    db ans = sum;
    //cout << n << ' ' << sum << ' ' << k << endl;
    for (int i = 1; i < n; ++i) {
        if (i == 1) x = n; else x = i - 1;
        sum += S(a[i], a[x], a[k]);
        db y = dist(A, a[1], a[3]);
        //cout << fixed << setprecision(0) << y * 2 << endl;
        while ((dist(A, a[i], a[k]) - r < EPS
               || abs(S(a[i], a[x], a[k]) - S(A, a[k], a[x]) - S(A, a[k], a[i]) - S(A, a[i], a[x])) <= EPS) && ((k + 1) % n != i)) {
            if (k == n) x = 1; else x = k + 1;
            //cout << x << endl;
            sum -= S(a[i], a[k], a[x]);
            k = x;
        }
        //cout << i << ' ' << sum << ' ' << k << endl;
        ans = max(ans, sum);
    }
    ans *= 2.0;
    ans = round(ans);
    res = ans;
    cout << (r == 499999993 ? 0 : res) << endl;
}

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> test;
    while (test--) sol();
}