#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define pb push_back
#define db double
#define lowbit(x) x&(-x)
#define cerr(x) cout<<#x<<"="<<x<<endl
#define fi first
#define se second
#define N 100010
const db eps=1e-10;
int n;
ll rx,ry,r;
struct node{
    ll x,y;
    node(){}
    node(ll _x,ll _y):x(_x),y(_y){}
    node operator+(const node&t) const {return {x+t.x,y+t.y};}
    node operator-(const node&t) const {return {x-t.x,y-t.y};}
}p[N],o;
int js(int x) {
    return x>n?1:x;
}
ll dis(node a,node b) {
    ll dx=a.x-b.x,dy=a.y-b.y;
    return dx*dx+dy*dy;
}
ll cross(node a,node b) {
    return a.x*b.y-b.x*a.y;
}
ll pow_(ll x) {return x*x;}
void solve() {
    cin>>n;
    cin>>rx>>ry>>r;
    o=node(rx,ry);
    for(int i=1;i<=n;i++) {
        cin>>p[i].x>>p[i].y;
    }
    ll ans=0,mx=0;
    for(int i=1,j=i+1;i<=n;i++) {
        int id=js(j+1);
        while(cross(p[id]-p[i],o-p[i])>=-eps && pow_(cross(p[id]-p[i],o-p[i]))>=pow_(r)*dis(p[id],p[i]) && id!=i) {
            ll s=cross(p[j]-p[i],p[id]-p[i]);
            ans+=s,j=id,id=js(j+1),mx=max(mx,ans);
        }
        int tmp=js(i+1);
        ans-=cross(p[tmp]-p[i],p[j]-p[i]);
    }
    cout<<mx<<endl;
}
int main() {
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int T;
    cin>>T;
    while(T--) 
    solve();
    return 0;
}