#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int MAXN = 2e5 + 5;
int n;
ll r;
struct Vector
{
    ll x,y;
    Vector operator - (const Vector &a)const
    {
        return Vector{x - a.x,y - a.y};
    }
    ll operator * (const Vector &a)const
    {
        return abs(x * a.y - y * a.x);
    }
    double length()
    {
        return sqrt(x * x + y * y);
    }
}dot[MAXN],rd;
double COS(Vector v1,Vector v2)
{
    return 1.0 * (v1.x * v2.x + v1.y * v2.y) / v1.length() / v2.length();
}
bool check(int i,int j)
{
    if(i + 1 >= j) return true;

    Vector v1 = dot[j] - dot[i],v2 = dot[j - 1] - dot[i],vr = rd - dot[i];

    // cout << v1.x << " " << v1.y << " " << v2.x << " " << v2.y << endl;
    // cout << COS(v1,v2) << " " << COS(v1,vr) << " " << COS(v2,vr) << endl;

    return !(COS(v1,v2) < COS(v1,vr) && COS(v1,v2) < COS(v2,vr)) && r <= v1 * vr / v1.length();
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        scanf("%lld %lld %lld",&rd.x,&rd.y,&r);
        for(int i = 1; i <= n; ++i)
            scanf("%lld %lld",&dot[i].x,&dot[i].y);
        for(int i = n + 1; i <= 2 * n; ++i)
            dot[i] = dot[i - n];
        int cur = 1;
        ll res = 0,now = 0;

        // cout << check(3,6) << endl;

        for(int i = 1 ; i <= n; ++i)
        {
            while(check(i,cur + 1) && cur < 2 * n)
            {
                now += (dot[cur] - dot[i]) * (dot[cur + 1] - dot[i]);
                ++cur;
                res = max(res,now);
            }
            // cout << "debug:" << i << " " << cur << " " << now << endl;
            now -= (dot[i] - dot[cur]) * (dot[i + 1] - dot[cur]);
        }
        printf("%lld\n",res);
    }
    return 0;
}