#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using db = long double;

constexpr db eps = 1e-12;

struct point {
    ll x, y;

    point operator + (const point &a) const {
        return {x+a.x, y+a.y};
    }
    point operator - (const point &a) const {
        return {x-a.x, y-a.y};
    }
    ll operator * (const point &a) const {
        return x*a.x + y*a.y;
    }
    ll operator ^ (const point &a) const {
        return x*a.y - y*a.x;
    }
    int toleft(const point &a) const {
        const auto t = (*this) ^ a;
        return (t>0) - (t<0);
    }
    db len() const {
        return sqrtl(len2());
    }
    db len2() const {
        return (*this)*(*this);
    }
    db dis(const point &a) const {
        return sqrtl(((*this) - a).len2());
    }
};

struct line {
    point p, v;
    db dis(const point &a) const {
        return abs(v^(a-p))/v.len();
    }
    int toleft(const point &a) const {
        return v.toleft(a-p);
    }
};

struct circle {
    point c; ll r;
    
    // 1, c is on left of l
    // 0, c strictly intersects with l
    // -1, c is on right side
    int onleft(line &l) {
        auto d = l.dis(c);
        if(d < r - eps) return 0;
        return l.toleft(c);
    }
};


void solve() {
    int n; cin >> n;
    circle C;
    cin >> C.c.x >> C.c.y >> C.r;
    vector<point>vec(n);
    for(auto &[x, y]: vec) cin >> x >> y;
    vec.insert(end(vec), begin(vec), end(vec));
    // cout << "point1" << endl;
    // return;
    

    // 2*area of triangle (0, vec[i], vec[i+1])
    auto ask = [&](int id) {
        return vec[id]^vec[id+1];
    };
    auto ask2 = [&](int l, int r) {
        return vec[l]^vec[r];
    };
    auto check = [&](int l, int r) -> bool {
        line ln{vec[l], vec[r]-vec[l]};
        return C.onleft(ln)==1;
    };

    ll ans = 0;


    int count = 0;
    ll temp = 0;

    for(int i = 0, j = 0; i < n ; i ++) {
        if(i) temp -= ask(i-1); 
        while(check(i, j+1)) {
            // j, j+1, 0
            temp += ask(j);
            j++;
            //if(++count==10) break;
            //cout << i << ' ' << j << endl;
            //cout << "point3" << endl;
        }
        ans = max(ans, temp - ask2(i, j));
        
    }
    cout << ans << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t; cin >> t;
    while(t--) {
        solve();
    }

    return 0;
}