#include<bits/stdc++.h>
#define ll __int128_t
#define eps 1e-4
using namespace std;
// #define double long double
const int N=100010;
namespace my128 { // 读入优化封装，支持__int128
    using i64 = __int128_t;
    i64 abs(const i64 &x) {
        return x > 0 ? x : -x;
    }
    auto &operator>>(istream &it, i64 &j) {
        string val;
        it >> val;
        reverse(val.begin(), val.end());
        i64 ans = 0;
        bool f = 0;
        char c = val.back();
        val.pop_back();
        for (; c < '0' || c > '9'; c = val.back(), val.pop_back()) {
            if (c == '-') {
                f = 1;
            }
        }
        for (; c >= '0' && c <= '9'; c = val.back(), val.pop_back()) {
            ans = ans * 10 + c - '0';
        }
        j = f ? -ans : ans;
        return it;
    }
    auto &operator<<(ostream &os, const i64 &j) {
        string ans;
        function<void(i64)> write = [&](i64 x) {
            if (x < 0) ans += '-', x = -x;
            if (x > 9) write(x / 10);
            ans += x % 10 + '0';
        };
        write(j);
        return os << ans;
    }
} // namespace my128

using namespace my128;
struct point{
    ll x;
    ll y;
}P[N];
ll S[N];
ll S_s[N];
int n;
ll xr,yr,r;
ll M(point a,point b)
{
    return 1ll*a.x*b.y-1ll*b.x*a.y;
}
ll find_area(int left,int right)
{
    if(left<=right)return S_s[right-1]-S_s[left-1]-(M(P[left],P[right]));
    else{
        ll temp=S_s[n-1]-S_s[left-1]+S_s[right-1]+S[n];
        return temp-M(P[left],P[right]);
    }
}
double find_d(int left,int right)
{
    if(left==right)return sqrt(double(P[left].x*P[left].x+P[left].y*P[left].y))*1.00;
    double d1=sqrt(double((P[left].x-P[right].x)*(P[left].x-P[right].x)+(P[left].y-P[right].y))*(P[left].y-P[right].y))*1.00;
    double d=M(P[left],P[right])*1.00/d1;
    //printf("%d %d %lf %lf\n",left,right,d1,d);
    return d;
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        // scanf("%lld %lld %lld",&xr,&yr,&r);
        cin >> xr >> yr >> r;
        for(int i=1;i<=n;i++)
        {
            // scanf("%lld %lld",&P[i].x,&P[i].y);
            cin >> P[i].x >> P[i].y;
            P[i].x=(P[i].x)-xr*1ll;
            P[i].y=(P[i].y)-yr*1ll;
        }
        S_s[0]=0ll;
        for(int i=1;i<=n;i++)
        {
            if(i<n)S[i]=M(P[i],P[i+1]);
            else S[i]=M(P[i],P[1]);
            //printf("%lld\n",S[i]);
            S_s[i]=S_s[i-1]+S[i];
        }
        int curr=1;
        ll ans=0ll;
        for(int i=1;i<=n;i++)
        {
            while(find_d(i,(curr%n)+1)+eps>=1.00*r)
            {
                curr=(curr%n)+1;
                ll tp=find_area(i,curr);
                if(tp<0)tp=-tp;
                ans=max(1ll*ans,tp*1ll);
            }
        }
        curr=n;
        for(int i=n;i>=1;i--)
        {
            while(find_d(i,((curr+n-2)%n)+1)-eps<=-1.00*r)
            {
                curr=((curr+n-2)%n)+1;
                ll tp=find_area(curr,i);
                if(tp<0)tp=-tp;
                ans=max(ans*1ll,tp*1ll);
            }
        }
        // printf("%lld\n",ans);
        cout << ans << "\n";
        
    }
    return 0;
}