#include<bits/stdc++.h>
using namespace std;
#define V vector
#define fi first
#define se second
typedef pair<int, int> pi;
typedef long long LL;

LL det(pi a, pi b) {
    return 1LL * a.fi * b.se - 1LL * a.se * b.fi;
}
LL dot(pi a, pi b) {
    return 1LL * a.fi * b.fi + 1LL * a.se * b.se;
}
LL sqr(int a) {
    return 1LL * a * a;
}
pi operator - (pi a, pi b) {
    return {a.fi - b.fi, a.se - b.se};
}
pi operator + (pi a, pi b) {
    return {a.fi + b.fi, a.se + b.se};
}
LL dis2(pi a) {
    return sqr(a.fi) + sqr(a.se);
}
LL closer(pi a, pi b, pi x, int r) {
    pi dir = (b - a);
    swap(dir.fi, dir.se);
    dir.fi = -dir.fi;

    return 1LL * r * r > sqr(dot(dir, a - x)) / dis2(dir);
}
void solve() {
    int n; cin >> n;
    pi o; cin >> o.fi >> o.se;
    int rad; cin >> rad;
    V<pi> a(n * 2);
    for(int i = 0; i < n; i++) cin >> a[i].fi >> a[i].se, a[i + n] = a[i];

    V<LL> sum(n * 2);
    for(int i = 1; i < 2 * n; i++) {
        sum[i] = sum[i - 1] + det(a[i - 1], a[i]);
    }

    LL ans = 0;

    int r = 0;
    for(int l = 0; l < n; l++) {
        while(!closer(a[l], a[r + 1], o, rad) && det(a[r + 1] - a[l], o - a[l]) > 0) r++;
        ans = max(ans, sum[r] - sum[l] + det(a[r], a[l]));
    }

    r = 2 * n - 1;
    for(int l = 2 * n - 1; l >= n; l--) {
        while(!closer(a[l], a[r - 1], o, rad) && det(a[r - 1] - a[l], o - a[l]) < 0) r--;
        ans = max(ans, sum[l] - sum[r] + det(a[l], a[r]));
    }

    // assert(ans % 2 == 0);

    cout << ans / 1 << endl;
}

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