#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,g,n) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_back
#define eb emplace_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<typename T> using pq = priority_queue<T,vector<T>,greater<T>>;
using P = pair<int,int>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}

using ld = long double;
static constexpr ld pi = acos(-1);

void solve() {
  ll xa, ya, za, xb, yb, zb, ra, rb;
  cin >> xa >> ya >> za >> ra >> xb >> yb >> zb >> rb;
  ll d2 = (xa-xb)*(xa-xb)+(ya-yb)*(ya-yb)+(za-zb)*(za-zb);
  ld d = sqrtl((xa-xb)*(xa-xb)+(ya-yb)*(ya-yb)+(za-zb)*(za-zb));
  if (d2 >= (ra+rb)*(ra+rb)) {
    cout << 0 << endl;
    return;
  }
  if (ra >= rb && d2 <= (ra-rb)*(ra-rb)) {
    ld ans = ld(4.0)*rb*rb*rb*pi/3.0;
    printf("%.10Lf\n", ans);
    return;
  }
  if (rb >= ra && d2 <= (rb-ra)*(rb-ra)) {
    ld ans = ld(4.0)*ra*ra*ra*pi/3.0;
    printf("%.10Lf\n", ans);
    return;
  }
  ld x = ld(ra*ra-rb*rb+d2)/(2.0*d), y = ld(rb*rb-ra*ra+d2)/(2.0*d);
  // cout << x << " " << y << endl;
  ld t1 = (x*x*x+(2.0*ra-3.0*x)*ra*ra)/3.0;
  ld t2 = (y*y*y+(2.0*rb-3.0*y)*rb*rb)/3.0;
  printf("%.10Lf\n", (t1+t2)*pi);
}

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