#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using pq_ = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(int)(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}

const long double pi = acosl(-1);

void solve();
// DEAR MYSTERIES / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    using ld = long double;
    struct F {
        ld x, y, z, r;
    };
    vector<F> p(2);
    rep(i, 0, 2) {
        cin >> p[i].x >> p[i].y >> p[i].z >> p[i].r;
    }
    if (p[0].r > p[1].r) swap(p[0], p[1]);
    ll DIST = 0;
    {
        ll tmp = p[0].x - p[1].x;
        DIST += tmp * tmp;
    }

    {
        ll tmp = p[0].y - p[1].y;
        DIST += tmp * tmp;
    }

    {
        ll tmp = p[0].z - p[1].z;
        DIST += tmp * tmp;
    }
    ld dist = sqrtl(DIST);
    // cout << dist << "\n";
    ll dr = p[1].r - p[0].r;
    if (DIST <= dr * dr) {
        cout << fixed << setprecision(20) << pi * 4 * p[0].r * p[0].r * p[0].r / 3 << "\n";
        return;
    }
    dr = p[0].r + p[1].r;
    if (DIST >= dr * dr) {
        cout << "0\n";
        return;
    }
    vector<ld> q(2);
    // dist, p[0].r, p[1].r の三角形を考える

    // https://manabitimes.jp/math/968
    auto f = [&](ld r, ld x) -> ld {
        return pi * (r * r - x * x / 3) * x;
    };
    ld ans = 0;
    rep(rp, 0, 2) {
        swap(p[0], p[1]);
        // https://manabitimes.jp/math/2125
        ld tmp = (p[0].r * p[0].r + dist * dist - p[1].r * p[1].r) / (2 * dist);
        // cout << p[0].r << " " << tmp << "\n";
        ans += f(p[0].r, p[0].r);
        ans -= f(p[0].r, tmp);
    }
    cout << fixed << setprecision(20) << ans << "\n";
}