#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>	// require sort next_permutation count __gcd reverse etc.
#include <cstdlib>	// require abs exit atof atoi 
#include <cstdio>		// require scanf printf
#include <functional>
#include <numeric>	// require accumulate
#include <cmath>		// require fabs
#include <climits>
#include <limits>
#include <cfloat>
#include <iomanip>	// require setw
#include <sstream>	// require stringstream 
#include <cstring>	// require memset
#include <cctype>		// require tolower, toupper
#include <fstream>	// require freopen
#include <ctime>		// require srand
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()

using namespace std;

typedef long long ll;
typedef pair<double, double> P;
typedef pair<double,P> dP;

dP calc_eq (double xa, double ya, double xb, double yb )
{
	double a = (xb - xa );
	double b = (yb - ya );
	double c = (xb - xa)*(xb + xa )/2. + (yb - ya)*(yb+ya )/2.;

	return dP (a, P (b, c ) );		
}

double calc_radius (double xa, double ya, double xb, double yb )
{
	double res = (xa - xb)*(xa - xb) + (ya - yb)*(ya - yb );

	return sqrt (res );
}

int main()
{
//	cut here before submit 
//	freopen ("testcase.CCT", "r", stdin );
	int n;
	cin >> n;
	rep (i, n ){
		double x1, y1, x2, y2, x3, y3;
		cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3;
		dP l1 = calc_eq (x1, y1, x2, y2 );
		dP l2 = calc_eq (x1, y1, x3, y3 );

		double a = l1.first, b = l1.second.first, c = l1.second.second;
		double d = l2.first, e = l2.second.first, f = l2.second.second;
/*
		cerr << "a: " << a << " b: " << b << " c: " << c << endl;
		cerr << "d: " << d << " e: " << e << " f: " << f << endl;
*/
		double x = 0.0, y = 0.0, r = 0.0;
		x = (c*e - b*f)/(a*e - b*d);
		y = (c*d - a*f)/(b*d - a*e);
		r = calc_radius (x, y, x1, y1 );

		if (fabs(x) < 1.0e-3){
			x = 0.0;
		} // end if
		if (fabs(y) < 1.0e-3){
			y = 0.0;
		} // end if

		printf ("%.3f %.3f %.3f\n", x, y, r );

	} // end loop
		
	return 0;
}