#include <bits/stdc++.h>

using namespace std;

#define int long long

const int N = 1e6 + 5;
#define eps 1e-12

int n, r;

struct Point
{
  int x, y;
  Point(int _x = 0, int _y = 0) {x = _x, y = _y;}
  friend Point operator - (Point a, Point b) {
    return Point(a.x - b.x, a.y - b.y);
  }
  friend int operator * (Point a, Point b) {
    return a.x * b.y - a.y * b.x;
  }
} O, a[N];

struct Line {int a, b, c;};
double DIS(Point a, Line l) {return fabs((double)(l.a * a.x + l.b * a.y + l.c) / sqrtl(l.a * l.a + l.b * l.b));}

int _abs(int x) {return x < 0 ? -x : x;}

void solve()
{
  cin >> n >> O.x >> O.y >> r;
  for(int i = 1; i <= n; i++) cin >> a[i].x >> a[i].y, a[n + i] = a[i];

  int S = 0, Ans = 0;
  for(int i = 1, j = 1; i <= n; i++)
  {
    while(((a[i] - O) * (a[j] - O)) * ((a[i] - O) * (a[j + 1] - O)) >= 0)
    {
      Line L; L.a = a[i].y - a[j + 1].y, L.b = a[j + 1].x - a[i].x, L.c = a[i].x * a[j + 1].y - a[i].y * a[j + 1].x;
      // if(DIS(O, L) < r) break;
      if((__int128)(L.a * O.x + L.b * O.y + L.c) * (L.a * O.x + L.b * O.y + L.c) < (__int128)r * r * (L.a * L.a + L.b * L.b)) break;
      j++;
      if(j - i >= 2) S += _abs((a[j - 1] - a[i]) * (a[j] - a[i]));
    }
    // cerr << i << " " << j << ": " << S << "\n";
    if(S > Ans) Ans = S;
    if(j - i >= 2) S -= _abs((a[i] - a[j]) * (a[i + 1] - a[j]));
  }
  cout << Ans << "\n";
  return;
}

signed main()
{
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);

  int T; cin >> T;
  while(T--) solve();
  return 0;
}