#include<bits/stdc++.h>
using namespace std;
const int N=100005;
const long double eps=1e-6;
int n;
struct Point
{
    long double x,y;
    Point(long double _x=0,long double _y=0):x(_x),y(_y){}
    friend Point operator+(const Point &a,const Point &b)
    {
        return Point(a.x+b.x,a.y+b.y);
    }
    friend Point operator-(const Point &a,const Point &b)
    {
        return Point(a.x-b.x,a.y-b.y);
    }
    friend bool operator==(const Point &a,const Point &b)
    {
        return abs(a.x-b.x)<=eps&&abs(a.y-b.y)<=eps;
    }
    Point operator*(const long double &v)const
    {
        return Point(x*v,y*v);
    }
    Point operator/(const long double &v)const
    {
        return Point(x/v,y/v);
    }
    long double length()const
    {
        return sqrtl((long long)x*x+(long long)y*y);
    }
    Point unit()const
    {
        return *this/length();
    }
    friend long double dot(const Point &a,const Point &b)
    {
        return a.x*b.x+a.y*b.y;
    }
    friend long double cross(const Point &a,const Point &b)
    {
        return a.x*b.y-a.y*b.x;
    }
}p[N];
long double distance(const Point &x,const Point &y)
{
    return (x-y).length();
}
struct Line
{
    Point a,b;
    Line(const Point &_a,const Point &_b):a(_a),b(_b){}
    Point projection(const Point &p)const
    {
        return a+(b-a).unit()*(dot(p-a,b-a)/(b-a).length());
    }
};
void solve()
{
    cin>>n;
    Point o;
    int r;
    cin>>o.x>>o.y>>r;
    for(int i=1;i<=n;i++)
        cin>>p[i].x>>p[i].y;
    long double ans=0;
    long double sum=0;
    for(int i=1,j=1;i<=n;i++)
    {
        while(cross(p[j]-p[i],o-p[i])>=-eps&&(p[i]==p[j]||distance(o,Line(p[i],p[j]).projection(o))>=r-eps)) sum+=cross(p[j],p[j%n+1]),j=j%n+1;
        int lstj=j-1;
        if(lstj==0) lstj=n;
        ans=max(ans,sum-cross(p[lstj],p[j])+cross(p[lstj],p[i]));
        sum-=cross(p[i],p[i%n+1]);
    }
    reverse(p+1,p+n+1);
    sum=0;
    for(int i=1,j=1;i<=n;i++)
    {
        while(cross(p[j]-p[i],o-p[i])<=eps&&(p[i]==p[j]||distance(o,Line(p[i],p[j]).projection(o))>=r-eps)) sum+=-cross(p[j],p[j%n+1]),j=j%n+1;
        int lstj=j-1;
        if(lstj==0) lstj=n;
        ans=max(ans,sum+cross(p[lstj],p[j])-cross(p[lstj],p[i]));
        sum-=-cross(p[i],p[i%n+1]);
    }
    cout<<fixed<<setprecision(0)<<ans<<"\n";
    return;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr),cout.tie(nullptr);
    int T;
    cin>>T;
    while(T--)
        solve();
    return 0;
}