#include <bits/stdc++.h>

using namespace std;
using ll = long long;
const double eps=1e-18;
const int MAXN=5e5+7;                                                         
struct Point{                                                                        
    double x,y;                                                                      
    Point(double x=0,double y=0):x(x),y(y){}
};
typedef Point Vector;
Point a[MAXN],be;
vector<Point> c;
int t;
int n;
double be_x,be_y,r;
ll sum[MAXN];

Vector operator + (Vector A,Vector B){return Vector(A.x+B.x,A.y+B.y);}
Vector operator - (Vector A,Vector B){return Vector(A.x-B.x,A.y-B.y);}
Vector operator * (Vector A,double B){return Vector(A.x*B,A.y*B);}
Vector operator / (Vector A,double B){return Vector(A.x/B,A.y/B);}

int dcmp(double x){if(fabs(x)<eps)return 0;return (x>0)?1:-1;}
bool operator == (const Vector A,const Vector B){
    return dcmp(A.x-B.x)==0 && dcmp(A.y-B.y)==0;
}
double Dot(Vector A,Vector B){return A.x*B.x+A.y*B.y;}  
double Length(Vector A){return sqrt(Dot(A,A));}                        
double Cross(Vector A,Vector B){return A.x*B.y-B.x*A.y;}              

double DistanceToSegment(Point P,Point A,Point B){
    if(A==B)return Length(P-A);
    Vector v1=B-A,v2=P-A,v3=P-B;
    if(dcmp(Dot(v1,v2))<0)return Length(v2);           
    else if(dcmp(Dot(v1,v3))>0)return Length(v3);      
    else return fabs(Cross(v1,v2))/Length(v1);                   
}
bool check2(Point P,Point A,Point B){
    if(A==B)return 1;
    Vector v1=B-A,v2=P-A,v3=P-B;
    if(dcmp(Dot(v1,v2))<0)
    {
        if(Length(v2)>r||fabs(Length(v2)-r)<=eps) return 1;
        return 0; 
    }          
    else if(dcmp(Dot(v1,v3))>0)
    {
        if(Length(v3)>r||fabs(Length(v3)-r)<=eps) return 1;
        return 0;
    }    
    else
    {
        if(fabs(Cross(v1,v2))>r*Length(v1)||fabs(fabs(Cross(v1,v2))-r*Length(v1))<=eps) return 1;
        return 0;
    }
}
double ComputePolygonArea(vector<Point> &points)
{
    int point_num = points.size();
    if(point_num < 3)return 0.0;
    double s = points[0].y * (points[point_num-1].x - points[1].x);
    for(int i = 1; i < point_num; ++i)
        s += points[i].y * (points[i-1].x - points[(i+1)%point_num].x);
    return fabs(s/2.0);
}

double Distance(Point p,Point a,Point b)
{
    Vector v1=b-a,v2=p-a;
    return fabs(Cross(v1,v2));
}
// bool check2(Point a,Point b)
// {
//     Point kkk={be_x,be_y};
//     if(Distance(kkk,a,b)<(r*abs(Length(b-a)))) return 0;
//     return 1;
// }
bool check1(Point a,Point b,Point c)
{
    __int128 res1=Cross(a,b),res2=Cross(a,c);
    if(res1*res2<0) return 0;
    return 1;
}
ll work(int l,int r)
{
    ll res=sum[r]-sum[l];
    c.clear();
    c.push_back(a[1]);
    c.push_back(a[l]);
    c.push_back(a[r]);
    res-=(ll) (ComputePolygonArea(c)*2.0);
    return res;
}
int main()
{
    cin.tie(nullptr) ->sync_with_stdio(false);

    cin>>t;
    while(t--)
    {
        cin>>n;
        cin>>be_x>>be_y>>r;
        be={be_x,be_y};
        for(int i=1;i<=n;i++) cin>>a[i].x>>a[i].y;
        for(int i=n+1;i<=2*n;i++) a[i]=a[i-n];
        
        sum[0]=sum[1]=sum[2]=0;
        for(int i=3;i<=n;i++)
        {
            c.clear();
            c.push_back(a[1]);
            c.push_back(a[i-1]);
            c.push_back(a[i]);
            sum[i]=sum[i-1]+(ll) (ComputePolygonArea(c)*2.0);
        }
        ll ans=0LL;
    
        for(int i=1;i<=n;i++)
        {
            int l=i,r=i+n-1,mid,loc=-1;
            Point k1=be-a[i];
            Point k2=a[i+1]-a[i];
            while(l<=r)
            {
                mid=(l+r)>>1;
                Point k3=a[mid]-a[i];
                if(check1(k1,k2,k3))
                {
                    if(check2(be,a[i],a[mid])) loc=mid,l=mid+1;
                    else r=mid-1;
                }
                else r=mid-1;
            }
            if(loc!=-1)
            {
                int lk=i%n,rk=loc%n;
                if(lk==0) lk=n;
                if(rk==0) rk=n;
                if(rk<lk)
                {
                    ll sum1=work(lk,n);
                    ll sum2=work(1,rk);
                    c.clear();
                    c.push_back(a[lk]);c.push_back(a[n]);
                    c.push_back(a[1]);c.push_back(a[rk]);
                    ll sumk=(ll) (ComputePolygonArea(c)*2.0);
                    
                    ans=max(ans,sum1+sum2+sumk);
                }
                else
                {
                    ans=max(ans,work(lk,rk));
                }
            }
        }
        cout<<ans<<'\n';
    }
    
    return 0;
}
/*

*/