#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define double long double
double sqr(double x) {return x*x;}
const int maxn = 1e5 + 10;
const double eps = 1e-12;
int n;
double fcmp(double x){
    if(fabs(x)<eps) return 0;
    if(x>0) return 1;
    return -1;
}
struct point{
    double x,y;
    double norm(){
        return sqrt(sqr(x)+sqr(y));
    }
}a[maxn],c;
double R;
point operator -(const point &a,const point &b){
    return (point){a.x-b.x,a.y-b.y};
}
point operator +(const point &a,const point &b){
    return (point){a.x+b.x,a.y+b.y};
}
double det(const point &a,const point &b) {return a.x*b.y-a.y*b.x;}
void solve(){
	cin>>n;
	cin>>c.x>>c.y>>R;
	for(int i=0;i<n;i++){
		cin>>a[i].x>>a[i].y;
	}
	double ans=0,now=0;
	for(int l=0,r=l+1;l<n;l++){
		if(l==r) {
			r=(r+1)%n;
			now=0;
		}
		while((r+1)%n!=l){
			int rr=(r+1)%n;
			double tmp=det(a[rr]-a[l],c-a[l]);
			if(fcmp(tmp)<=0) break;
			if(fcmp(tmp-(a[rr]-a[l]).norm()*R)<0) break;
			now+=det(a[r]-a[l],a[rr]-a[l]);
			r=rr;
		}
		ans=max(ans,now);
		int ll=(l+1)%n;
		now-=det(a[l]-a[r],a[ll]-a[r]);
	}
	printf("%.0Lf\n",ans);
}
int main(){
	int T;
	cin>>T;
	while(T--){
		solve();
	}
    return 0;
}