#include<bits/stdc++.h>
using namespace std;
#define int long long
 
int T,n,xc,yc,r;
struct P{
    int x,y;
    P(int x=0, int y=0): x(x),y(y){};
};

const double eps = 1e-8;
inline P operator+ (P A, P B){ return P(A.x + B.x, A.y + B.y);}
inline P operator- (P A, P B){ return P(A.x - B.x, A.y - B.y);}
inline bool operator== (P a, P b){ return a.x == b.x && a.y == b.y;}
inline int Cross(P a, P b){ return a.x * b.y - a.y * b.x;}
inline int Dot(P a, P b){ return a.x * b.x + a.y * b.y;}
inline double Length(P a){
    return sqrt(Dot(a, a));
}
inline int dcmp(double x){
    if(fabs(x) < eps) return 0;
    return x < 0? -1: 1;
}

inline double DistanceToLine(P p, P a, P b){
    P v1 = b - a, v2 = p - a;
    return Cross(v1, v2) / Length(v1);
}

inline int Area2(P a, P b , P c){
    return abs(Cross(b - a, c - a));
}

signed main(){
    cin >> T;
    while(T--){
        cin >> n;
        cin >> xc >> yc >> r;
        P c = {xc, yc};
        vector<P> v(n);
        for(int i=0;i<n;i++){
            cin >> v[i].x >> v[i].y;
        }

        int ans = 0;
        int area = 0;
        for(int i=0,j=1; i<n; i++){
            if(i == j) j = (j+1) % n;
            while(1){
                // cout << i << " " << j << endl;
                int nxt = (j+1) % n;
                double d = DistanceToLine(c, v[i], v[nxt]);
                if(dcmp(d-r) >= 0){
                    area += Area2(v[i], v[j], v[nxt]);
                    j = nxt;
                }
                else break; 
            }
            ans = max(area, ans);
            cout << i << " " << j << " " << area << " " << ans << endl; 
            area -= Area2(v[i], v[(i+1)%n], v[j]);
        }

        // area = 0;
        // for(int i=0,j=n-1; i<n;i++){
        //     if(i == j) j = (j+n-1) % n;
        //     while(1){
        //         int nxt = (j+n-1) % n;
        //         double d = -DistanceToLine(c, v[i], v[nxt]);
        //         if(dcmp(d-r) >= 0){
        //             area += Area2(v[i], v[j], v[nxt]);
        //             j = nxt;
        //         }
        //         else break; 
        //     }
        //     ans = max(area, ans);
        //     // cout << i << " " << j << " " << area << " " << ans << endl; 
        //     area -= Area2(v[i], v[(i+1)%n], v[j]);
        // }
        cout << ans << endl;
    }
     
}