#include<bits/stdc++.h>
#define int long long
#define pii pair<int, int>
#define ar(i) array<int, i>
using namespace std;
const int N=1e6+5, mod=1e9+7;
struct point{
    int x,y;
}poi[N];
int get_s(point a,point b,point c){
    b.x-=a.x;
    b.y-=a.y;
    c.x-=a.x;
    c.y-=a.y;
    int s=abs(b.x*c.y-c.x*b.y);
    return s;
}
point cir;
int r;
bool incir(point a,point b){
    int len2=(a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);
    int s=get_s(a,b,cir);
    return s*s<=r*r*len2;
}
bool incir(point a,point b,point c){
    int s1=get_s(a,b,cir);
    int s2=get_s(a,c,cir);
    int s3=get_s(c,b,cir);
    return s1+s2+s3==get_s(a,b,c);
}
int n;
int genshin;
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    cin>>genshin;
    while(genshin--){
        cin>>n>>cir.x>>cir.y>>r;
        for(int i=1;i<=n;++i){
            cin>>poi[i].x>>poi[i].y;
            poi[i+n]=poi[i];
        }
        int j=1;
        int ans=0;
        int mx=0;
        for(int i=3;i<=n*2;++i){
            ans+=get_s(poi[i],poi[i-1],poi[j]);
            while(i>j+1&&(i-j>=n||incir(poi[i],poi[j])||incir(poi[i],poi[j],poi[j+1]))){
                ans-=get_s(poi[i],poi[j],poi[j+1]);
                ++j;
            }
            if(!incir(poi[i],poi[j]))mx=max(mx,ans);
        }
        cout<<mx<<endl;
    }
    // cerr<<fixed<<setprecision(2)<<(double)clock()/CLOCKS_PER_SEC<<endl;
    return 0;
}