#include <bits/stdc++.h>
using namespace std;
#define LL long long
LL sqr(LL x) {return x*x;}
const int maxn = 2e5 + 10;
int n;
struct point{
    LL x,y;
    LL norm(){
        return (sqr(x)+sqr(y));
    }
}a[maxn],c;
LL R;
inline LL read(){
	LL f=1;
	LL x=0;
	char ch=getchar();
	while(!isdigit(ch)){
        if(ch=='-')f=-1;
        ch=getchar();
    }
    while(isdigit(ch))
        x=(x<<1)+(x<<3)+ch-'0',ch=getchar();
    return x*=f;
}
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};
}
LL det(point a,point b) {return a.x*b.y-b.x*a.y;}
inline void print(LL x){
    if(x<0){
        x=~(x-1);
        putchar('-');
    }
	if(x>9)
        print(x/10);
    putchar(x%10+'0');
}
void solve(){
	cin>>n;
	c.x=read();c.y=read();R=read();
	for(int i=0;i<n;i++){
		a[i].x=read();a[i].y=read();
	}
	LL ans=0,now=0;
	for(int l=0,r=l+1;l<n;l++){
		if(l==r) {
			r=(l+1)%n;
			now=0;
		}
		while((r+1)%n!=l){
			int rr=(r+1)%n;
			LL tmp=det(a[rr]-a[l],c-a[l]);
			if(tmp<=0) break;
			if(tmp*tmp<(a[rr]-a[l]).norm()*R*R) break;
            point t1=a[r]-a[l],t2=a[rr]-a[l];
			LL tmp2=t1.x*t2.y-t2.x*t1.y;
			now+=tmp2;
			r=rr;
		}
		ans=max(ans,now);
		int ll=(l+1)%n;
		LL tmp2=det(a[l]-a[r],a[ll]-a[r]);
		assert(tmp2>=0);
		now-=tmp2;
	}
	print(ans);
	printf("\n");
}
int main(){
	int T;
	cin>>T;
	while(T--){
		solve();
	}
    return 0;
}