#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#define FOR() ll le=e[u].size();for(ll i=0;i<le;i++)
#define QWQ cout<<"QwQ\n";
#define ll long long
#include <vector>
#include <queue>
#include <map>

typedef double db;
using namespace std;
const ll N=501010;
const ll qwq=303030;
const ll inf=0x3f3f3f3f;

inline ll read() {
    ll sum = 0, ff = 1; char c = getchar();
    while(c<'0' || c>'9') { if(c=='-') ff = -1; c = getchar(); }
    while(c>='0'&&c<='9') { sum = sum * 10 + c - '0'; c = getchar(); }
    return sum * ff;
}

ll T;
ll n,sum;
struct D{
    db x,y;
} O,ling,d[N];
db R;
struct line{ D s,t; line(){} line(D _s,D _t){s=_s;t=_t;} };

D  operator - (D A,D B) { return {A.x-B.x,A.y-B.y}; }
D  operator + (D A,D B) { return {A.x+B.x,A.y+B.y}; }
db operator ^ (D A,D B) { return A.x*B.y - B.x*A.y; }
db operator * (D A,D B) { return A.x*B.x + A.y*B.y; }
D operator * (D A,db k) { return {A.x*k,A.y*k}; }
db len2(D P) { return P.x*P.x + P.y*P.y; }
D operator / (D A,db k) { return {A.x/k,A.y/k}; }

D lineprog(D P,line L) {
    D M = L.t-L.s;
    return L.s + ( M * (M*(P-L.s) ) ) / len2(M);
}

ll check(ll i,ll j) {
    // cout<<"check("<<i<<","<<j<<") = ";
    if(j==n+1) j = 1;
    D A = d[i], B = d[j];
    i++;
    if(i==n+1) i = 1;
    D C = d[i];
    D E = lineprog(O,{A,B});
    if(len2(E-O) < R*R) {
        // cout<<"0\n";
        return 0;
    }
    ll res = 0;
    if(((A-B)^(A-O)) > 0) res ^= 1;
    if(((A-B)^(A-C)) > 0) res ^= 1;
    // cout<<res<<"\n";
    return res;
}

ll cha(int i,int j,int k) {
    if(i>n) i=1;
    if(j>n) j=1;
    if(k>n) k=1;
    return abs((d[i]-d[j]) ^ (d[i]-d[k]));
}

void chushihua() {
    sum = 0;
}

int main() {
    T = read();
    while(T--) {
        chushihua();
        n = read();
        O.x = read(); O.y = read(); R = read();
        for(ll i=1;i<=n;i++) {
            d[i].x = read(); d[i].y = read();
        }
        ll j=2, now = 0;
        for(ll i=1;i<=n;i++) {
            // cout<<"i = "<<i<<" j = "<<j<<"\n";
            while(check(i,j+1)) {
                now += cha(i,j+1,j);
                sum = max(sum,now);
                j++;
                if(j==n+1) j = 1;
            }
            now -= cha(i,i+1,j);
        }
        cout<<sum<<"\n";
    }
    return 0;
}