#include<bits/stdc++.h>
#define int long long
#define mod 998244353ll
#define pii pair<int,int>
#define fi first
#define se second
#define mems(x,y) memset(x,y,sizeof(x))
using namespace std;
const int maxn=200010;
const int inf=1e18;
inline int read(){
	int 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<<3)+(x<<1)+(ch-48);ch=getchar();}
	return x*f;
}
bool Mbe;

int n,x,y,c;
pii a[maxn];
int calc(pii a,pii b,pii c){
	return abs(a.fi*b.se+b.fi*c.se+c.fi*a.se-a.fi*c.se-b.fi*a.se-c.fi*b.se);
}
bool chk(pii u,pii v,int x,int y,int r){
	int a=v.se-u.se,b=u.fi-v.fi,c=-a*u.fi-b*u.se;
	return (__int128)(a*x+b*y+c)*(a*x+b*y+c)>(__int128)r*r*(a*a+b*b);
}
int get(pii a,pii b,pii c){
	b.fi-=a.fi,b.se-=a.se,c.fi-=a.fi,c.se-=a.se;
	return b.fi*c.se-b.se*c.fi;
}
int ans;
void work(){
	n=read();x=read(),y=read(),c=read();ans=0;
	for(int i=1;i<=n;i++)a[i]=a[i+n]={read(),read()};
	for(int i=1,j=2,sum=0;i<=n;i++){
		while(j<=2*n){
			if(!chk(a[i],a[j],x,y,c))break;
			if(j>i+1){
			// cout<<i<<" "<<j<<" "<<get(a[i],{x,y},a[j])<<" "<<get(a[i],{x,y},a[j-1])<<"\n";
				if((__int128)get(a[i],{x,y},a[j])*get(a[i],{x,y},a[j-1])<=0)break;
			}
			if(j>i+1)sum+=calc(a[i],a[j-1],a[j]);
			j++;
		}
		ans=max(ans,sum);
		// cout<<i<<" "<<j<<" "<<sum<<"\n";
		if(j>i+2)sum-=calc(a[i],a[i+1],a[i+2]);
		if(i+1==j)j++;
	}
	printf("%lld\n",ans);
}

// \
444

bool Med;
int T;
signed main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	
//	ios::sync_with_stdio(0);
//	cin.tie(0);cout.tie(0);
	
//	cerr<<(&Mbe-&Med)/1048576.0<<" MB\n";
	
	T=read();
	while(T--)work();
}