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

typedef pair<lll, lll> P;

#define x first
#define y second

/////////////////
inline lll read()
{
    lll x=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9')
    {
        if(ch=='-')
            f=-1;
        ch=getchar();
    }
    while(ch>='0' && ch<='9')
        x=x*10+ch-'0',ch=getchar();
    return x*f;
}
inline void write(lll xx)
{
    if (xx > 9)
    {
        write(xx / 10);
    }
    putchar(xx % 10 + 48);
}

/////////////////

lll cross(P a, P b)
{
    return a.x * b.y - a.y * b.x;
}
lll mul(P a, P b)
{
    return a.x * b.x + a.y * b.y;
}
lll mul(P a)
{
    return a.x * a.x + a.y * a.y;
}
P del(P a, P b)
{
    return {a.x - b.x, a.y - b.y};
}

void solve()
{
    lll n;
    n=read();

    P C;
    C.x=read();
    C.y=read();

    lll R;
    R=read();

    vector<P> a(n + 5);
    for (int i = 1; i <= n; i++)
    {
        a[i].x=read();
        a[i].y=read();
    }
    lll ans = 0;
    lll S = 0;
    for (int l = 1, r = l + 1; l <= n; l++)
    {
        while (1)
        {
            int rr = r % n + 1;
            lll s = cross(del(a[rr], a[l]), del(C, a[l]));
            if (s <= 0)
                break;
            if (s * s < mul(del(a[rr], a[l])) * R * R)
                break;
            S += cross(del(a[r], a[l]), del(a[rr], a[l]));
            r = rr;
        }
        ans = max(ans, S);
        int ll = l % n + 1;
        S -= cross(del(a[r], a[l]), del(a[r], a[ll]));
    }
    write(ans);
    putchar('\n');
}

int main()
{
    // ios::sync_with_stdio(false), std::cin.tie(nullptr), std::cout.tie(nullptr);
    freopen("ain.txt", "r", stdin);
    freopen("aout.txt", "w", stdout);
    lll _ = 1;
    // std::cin >> _;
    _=read();
    while (_--)
    {
        solve();
    }
    return 0;
}