#include<bits/stdc++.h>
using namespace std;
#define PI acos(-1)
const int N=1e5+10;
typedef __int128_t ll;
int c[N];


inline void read(register ll &x){
    x=0;register int f=1;register char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}//判断负数
    while(c>='0'&&c<='9')x=(x<<3)+(x<<1)+(c^48),c=getchar();
    //其中(x<<3)+(x<<1)等价于x*10,(c^48)等价于c-'0'
    x*=f;
}

inline void write(register ll &x)
{ 
	register int len=0,k1=x;
	if(k1<0)k1=-k1,putchar('-');
	while(k1)c[len++]=k1%10+'0',k1/=10;
	while(len--)putchar(c[len]);
}

ll r;

struct point
{
	ll x,y;
}p[N];
 
point C;
 
point operator+(point a,point b)
{
	point s;
	s.x=a.x+b.x;
	s.y=a.y+b.y;
	return s;
}
	
point operator-(point a,point b)
{
	point s;
	s.x=a.x-b.x;
	s.y=a.y-b.y;
	return s;
}
 

 
ll dot(point a,point b)//向量点积 判断角度问题 
{
	return a.x*b.x+a.y*b.y;
}
 

ll operator*(point a,point b)
{
	return a.x*b.y-a.y*b.x;
}
 
ll cross(point a,point b,point c)
{
	return (b-a)*(c-a);
}
 
ll dis(point a,point b)
{
	return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);
}
 
bool dis1(point a,point b,point c)
{
    ll d=cross(a,b,c);
   // cout<<dis(b,c)<<endl;
    ll f=d*d;
    ll g=r*r*dis(b,c);
    //cout<<f<<' '<<g<<endl;
    return f<g;
}
 
//直线ab与线段cd的关系
//cross(a,b,c)*cross(a,b,d)>0 无交点 
//cross(a,b,c)*cross(a,b,d)<=0 有交点 
 
//线段ab与线段cd 
//cross(a,b,c)*cross(a,b,d)>0或cross(c,d,a)*cross(c,d,b)>0 无交点 
 
 
void solve(){
    int n;
    cin>>n;
	read(C.x);
	read(C.y);
	read(r);
    for(int i=1;i<=n;i++) 
	{
		read(p[i].x);
		read(p[i].y);
	}

    ll ans=0;
    ll fans=0;
    for(int i=1,j=i+1;i<=n;i++)
    {
        while(1)
        {
            int f=j%n+1;
            //cout<<i<<' '<<j<<' '<<f<<' '<<cross(p[i],p[f],C)<<' '<<cross(p[i],p[j],p[f])<<endl;
            if(cross(p[i],p[f],C)<=0) break;
           // cout<<dis1(C,p[i],p[f])<<endl;
            if(dis1(C,p[i],p[f])) break;
            ans+=(ll)(cross(p[i],p[j],p[f]));
            //cout<<i<<' '<<j<<' '<<f<<endl;
            j=f;
        }
        //cout<<ans<<endl;
        //cout<<i<<' '<<j<<endl;
        fans=max(fans,ans);
        int d=i%n+1;
        //if(j<=i) j=d;
        ans-=cross(p[i],p[d],p[j]);
    }
	write(fans);
	if(fans==0)
	{
		cout<<0;
	}
	cout<<'\n';
}
 
int main()
{
    int t;
    cin>>t;
    while(t--) solve();
    return 0;
}