#include<bits/stdc++.h>
using namespace std;
using i64 = long long;

//const int N = 1e5+5;


struct Point{
    i64 x , y ; 
};


i64 dot(Point a, Point b) { 
    return a.x * b.x + a.y * b.y;
}

i64 cross(Point a, Point b) {
    return a.x * b.y - b.x * a.y;
}

i64 mul(Point a) {
    return dot(a,a);
}

Point del(Point a , Point b){
    return {a.x - b.x , a.y - b.y} ;
}

void solve(){
    int n ; 
    cin >> n ;
    Point c ; 
    cin >> c.x >> c.y ;
    i64 r ;
    cin >> r ;
    vector<Point> a(n) ;
    for(int i = 0 ;i < n ;i++){
        cin >> a[i].x >> a[i].y ;
    }
    i64 ans = 0 , temp = 0;
    for(int lo = 0 , hi = lo + 1; lo < n ;lo++){
       
        while(true){
            int next_r = (hi + 1) % n ;
            i64 add_s = cross(del(a[next_r] , a[lo]) , del(c , a[lo])) ;
            // cerr << n << " " <<  lo << " " << hi << " " << next_r << "\n";
            // write(add_s) ;
            // putchar('\n');
            if(add_s <= 0){
                break ;
            }
            if(add_s * add_s < mul(del(a[next_r] , a[lo])) *  r *  r ){
                break ;
            }
            temp += cross(del(a[hi] , a[lo]) , del(a[next_r] , a[lo])) ;
            hi = next_r ; 
        }

        ans = max(ans , temp) ; 
        int next_l = (lo + 1) % n  ;
        temp -= cross(del(a[hi] , a[lo]) , del(a[hi] , a[next_l])) ;
    }
  cout << ans << "\n";
}


int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr) ;
    int tt = 1 ;
    cin >> tt;
    while(tt--){
        solve() ;
    }
    return 0;
}