#include<bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
int n,r;
struct VECTOR
{
	int x,y;
	int operator*(const VECTOR &v)const
	{
		return x*v.x+y*v.y;
	}	
	int operator^(const VECTOR &v)const
	{
		return x*v.y-y*v.x;
	}
};
struct POINT
{
	int x,y;
	VECTOR operator-(const POINT &p)const
	{
		return {x-p.x,y-p.y};
	}	
}p[2005],p0,o={0,0};
bool check(POINT p1,POINT p2)
{
	VECTOR v1=p2-p1,v2=p0-p1;
	if((v1^v2)<=0)return 0;
	return ((__int128)(v1^v2))*(v1^v2)>=((__int128)(v1*v1))*r*r;
}
void solve()
{
	cin>>n;
	cin>>p0.x>>p0.y>>r;
	for(int i=0;i<n;i++)
		cin>>p[i].x>>p[i].y;
	int sum=0;
	for(int i=0;i<n;i++)
		sum+=((p[i]-o)^(p[(i+1)%n]-o));
	int j=0,area=0,ans=0;
	for(int i=0;i<n;i++)
	{
		while(check(p[i],p[(j+1)%n]))
		{
			j=(j+1)%n;
			VECTOR v1=p[j]-p[(j-1+n)%n],v2=p[i]-p[(j-1+n)%n];
			area+=abs((v1^v2));
			if(((p[i]-p[(i-1+n)%n])^(p[(i+1)%n]-p[i]))==0)continue;
			if(((p[j]-p[(j-1+n)%n])^(p[(j+1)%n]-p[j]))==0)continue;
			ans=max(ans,area);
		}
		VECTOR v1=p[(i+1)%n]-p[i],v2=p[j]-p[i];
		area-=abs((v1^v2));
	}
	cout<<ans<<endl;
}
signed main()
{
	ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	int T=1;
	cin>>T;
	while(T--)solve();
	return 0;
}
/*
1
6
0 0 499999993
197878055 -535013568
696616963 -535013568
696616963 40162440
696616963 499999993
-499999993 499999993
-499999993 -535013568

1
4
3 2 1
3 0
6 3
3 6
0 3
*/