#include <bits/stdc++.h>
using namespace std;
using ui = unsigned int;
using ull = unsigned long long;
using ll = long long;
#define endl '\n'
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int maxn = 2e5 + 10;
const int mod = 1000000007;
#define inl inline
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define ford(i, a, b) for (int i = a; i >= b; i--)
#define forall(i, a) for (auto &i : a)

/**
   ____         ___ _____
  / ___| _   _ / _ \___ /
  \___ \| | | | | | ||_ \
   ___) | |_| | |_| |__) |
  |____/ \__, |\___/____/
         |___/
*/
istream &operator>>(istream &in, vector<int> &v)
{
    for (auto &i : v)
        in >> i;
    return in;
}
ostream &operator<<(ostream &out, vector<int> &v)
{
    for (auto &i : v)
        out << i << " ";
    return out;
}
bool _output = 1;

#define i64 __int128_t
void print(i64 x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        print(x / 10);
    putchar(x % 10 + '0');
}

struct P
{
    i64 x, y;
    P operator-(const P &a) const { return {x - a.x, y - a.y}; }
    i64 operator^(const P &a) const
    {
        return (i64)x * a.y - (i64)y * a.x;
    }
    i64 toleft(const P &a) const { return (i64)x * a.y - (i64)y * a.x; }
};
// ll cross(P a, P b) { return (i64)a.x * b.y - (i64)a.y * b.x; }
struct CIR
{
    i64 x, y, r;
    P c;
};
struct L
{
    P p, v;
    L(P p, P v) : p(p), v(v) {}
    bool dis(P &a, i64 r)
    {
        i64 t1 = (v ^ (a - p));
        // i64 t = t1 / sqrt((ll)v.x * (ll)v.x + (ll)v.y * (ll)(v.y));
        // cout << "area = ";
        // print(t);
        // cout << "  t1 = ";
        // print(t1);
        // cout << endl;
        return (i64)t1 * t1 <= (i64)r * r * (v.x * v.x + v.y * v.y);
    }
    i64 toleft(P &a)
    {
        return v ^ (a - p);
    }
};

void solve()
{
    int n;
    cin >> n;
    vector<P> a(n);
    CIR c;
    ll cx, cy, cr;
    cin >> cx >> cy >> cr;
    c.x = cx, c.y = cy, c.r = cr;
    P cc;
    cc.x = c.x, cc.y = c.y;
    c.c = cc;
    for (int i = 0; i < n; i++)
    {
        ll x, y;
        cin >> x >> y;
        a[i].x = x;
        a[i].y = y;
    }
    auto check_line_circle = [&](P x, P y)
    {
        L l = {x, y - x};
        if (l.dis(c.c, c.r))
        {
            return false;
        }
        return l.toleft(c.c) > 0;
    };
    int j = 0;
    i64 now = 0;
    i64 ans = 0;
    for (int i = 0; i < n; i++)
    {
        if (i)
        {
            now -= (i64)(a[i - 1] ^ a[i]);
        }
        j = max(j, i);
        while ((j + 1) % n != i && check_line_circle(a[i], a[(j + 1) % n]))
        {
            now += (i64)(a[j] ^ a[(j + 1) % n]);
            // print(now);
            // cout << endl;
            j++;
        }
        i64 t = now + (i64)(a[j] ^ a[i]);
        if (abs(j - i) >= 2)
            ans = max(ans, t);
    }

    print(ans);
    putchar('\n');
}
signed main()
{
    ios::sync_with_stdio(false);
    // cin.tie(0);
    // cout.tie(0);
    int _ = 1;
    if (_output)
        cin >> _;
    while (_--)
        solve();
    return 0;
}