#include<bits/stdc++.h>
#define int long long 
#define N 200010
using namespace std;
int T;
int x[N],y[N];
int X,Y,R,n;
class line{
    public:
    int x,y;
    friend int operator * (line a,line b)
    {
        return a.x*b.x+a.y*b.y;
    }
    friend line operator - (line a,line b)
    {
        return line{b.x-a.x,b.y-a.y};
    }
}s[N];
int len(line a)
{
    return a.x*a.x+a.y*a.y;
}
int val(line a,line b)
{
    return (a.x*b.y-a.y*b.x);
}
int opt(int x)
{
    if(x<0) return -1;
    if(x==0) return 0;
    if(x>0) return 1;
}
bool check(int l,int r)
{
    if(opt(val(s[r]-s[l],s[0]-s[l]))!=1) return false;
    __int128 a=1;
    if(a*val(s[r]-s[l],s[0]-s[l])*val(s[r]-s[l],s[0]-s[l])<a*len(s[r]-s[l])*R*R) return false;
    return true;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    cin>>T;
    while(T--)
    {
        cin>>n;
        cin>>X>>Y>>R;
        s[0]={X,Y};
        for(int i=1;i<=n;++i)
        {
            cin>>x[i]>>y[i];
            s[i].x=x[i],s[i].y=y[i];
            s[i+n]=s[n];
            x[i+n]=x[i],y[i+n]=y[i];
        }
        int l=1,r=1,res=0,now=0;
        while(l<=n)
        {
            while(r+1<=2*n&&check(l,r+1))
            {
                now+=abs(val(s[r]-s[l],s[r+1]-s[l]));
                ++r;
            }
            res=max(res,now);
            ++l;
            now-=abs(val(s[l]-s[l-1],s[r]-s[l-1]));
        }
        cout<<res<<endl;
    }
}