#include<bits/stdc++.h>
using namespace std;
#define ll long long
long long cross(pair<ll,ll>a,pair<ll,ll>b){
    return (1ll*a.first*b.second-1ll*a.second*b.first);
}
double dis(pair<ll,ll>a,pair<ll,ll>b,pair<ll,ll>o){
    if(a.first==b.first)return abs(a.first-o.first);
    double k=double(a.second-b.second)/(double)(a.first-b.first);
    double B=(double)a.second-k*a.first;
    double tmp=abs(k*o.first-(double)o.second+B)/sqrtl(k*k+(double)1);
    return abs(k*o.first-(double)o.second+B)/sqrtl(k*k+(double)1);
}
pair<ll,ll> reduce(pair<ll,ll>a,pair<ll,ll>b){
    return make_pair(a.first-b.first,a.second-b.second);
}
double Cos(pair<ll,ll>a,pair<ll,ll>b){
    double tmp=a.first*b.first+a.second*b.second;
    double m1=a.first*a.first+a.second*a.second;
    double m2=b.first*b.first+b.second*b.second;
    return tmp/sqrtl(m1)/sqrtl(m2);
}
void solve(){
    int R,x0,y0;
    int n;
    cin>>n>>x0>>y0>>R;
    vector<pair<ll,ll>>a;
    for(int i=1;i<=n;i++){
        pair<ll,ll>tmp;
        cin>>tmp.first>>tmp.second;
        a.push_back(tmp);
    }
    ll l=0,r=1;
    bool check1=0,check2=0;
    long long ans=0;
    long long sum=0;
    long long tot=0;
    // for(int i=0;i<n;i++){
    //     tot+=cross(a[i],a[(i+1)%n]);
    // }
    while(1){
        sum-=cross(a[r],a[l]);
        if(l==r||dis(a[(r+1)%n],a[l],make_pair(x0,y0))>=R&&acos(Cos(reduce(a[l],make_pair(x0,y0)),reduce(a[l],a[r])))>=acos(Cos(reduce(a[l],a[r]),reduce(a[l],a[(r+1)%n])))){
            sum+=cross(a[r],a[(r+1)%n]);
            r=((r+1)%n);
            sum+=cross(a[r],a[l]);
        }
        else {
            sum-=cross(a[l],a[(l+1)%n]);
            if(l+1>=n)break;
            l=(l+1)%n;
            sum+=cross(a[r],a[l]);
        }
        ans=max(ans,abs(sum));
    }
    l=1,r=2,sum=0;
    while(1){
        sum-=cross(a[r],a[l]);
        if(l==r||dis(a[(r+1)%n],a[l],make_pair(x0,y0))>=R&&acos(Cos(reduce(a[l],make_pair(x0,y0)),reduce(a[l],a[r])))>=acos(Cos(reduce(a[l],a[r]),reduce(a[l],a[(r+1)%n])))){
            sum+=cross(a[r],a[(r+1)%n]);
            r=((r+1)%n);
            sum+=cross(a[r],a[l]);
        }
        else {
            sum-=cross(a[l],a[(l+1)%n]);
            if(l+1>=n)break;
            l=(l+1)%n;
            sum+=cross(a[r],a[l]);
        }
        ans=max(ans,abs(sum));
    }
    cout<<ans<<endl;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t;
    cin>>t;
    while(t--)solve();
}