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

struct Point {
    LL x, y;
    Point(LL x = 0, LL y = 0) : x(x), y(y) {}
    void input() {
        cin >> x >> y;
    }
    Point operator - (const Point& b) const {
        return Point(x - b.x, y - b.y);
    }
    LL operator ^ (const Point& b) const {
        return x * b.y - y * b.x;
    }
    LL length2() {
        return x * x + y * y;
    }
    long double length() {
        return sqrtl(x * x + y * y);
    }
};

int sgn(long double x) {
    if (abs(x) <= 1E-7) {
        return 0;
    }
    return x > 0 ? 1 : -1;
}


void solve() {
    int n;
    cin >> n;

    Point c;
    c.input();
    LL r;
    cin >> r;

    vector<Point> p(n);
    for (int i = 0; i < n; i++) {
        p[i].input();
    }
    LL sum = 0, res = 0;
    for (int i = 0, j = 1; i < n; i++) {
        while (true) {
            int k = (j + 1) % n;
            LL s = (p[k] - p[i]) ^ (c - p[k]);
            // if (s > 0 && s * s >= r * r * (p[k] - p[i]).length2()) {
            if (sgn(s / (p[k] - p[i]).length() - r) >= 0) {
                sum += (p[j] - p[i]) ^ (p[k] - p[j]);
                j = k;
            } else {
                break;
            }
        }
        res = max(res, sum);
        if (sum > 0) {
            // cout << i << ' ' << j << endl;
            int k = (i + 1) % n;
            sum -= (p[k] - p[i]) ^ (p[j] - p[k]);
        }
    }
    cout << res << endl;
}

int main() {
    ios_base::sync_with_stdio(false);
    int tt;
    cin >> tt;
    while (tt--) solve();

    return 0;
}