#pragma GCC optimize("Ofast,no-stack-protector")
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) begin(x),end(x)
#define F(i,n) for (int i = 0; i < n; ++i)
#define F1(i,n) for (int i = 1; i <= n; ++i)
#define dbg(x) cerr << #x << " = " << x << endl
#define dbgg(x) cerr << #x << " = " << x << ' '
#define T(x) x[pool]
#define mineq(x,y) { if ((x) > (y)) (x) = (y); }
#define maxeq(x,y) { if ((x) < (y)) (x) = (y); }
#define MEOW { cout << "meowwwww" << '\n'; system("pause"); }
#define int long long
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

template<typename T>
ostream& operator <<(ostream &s, const vector<T> &c)
{
	s << "[ "; for (auto it : c) s << it << " "; s << "\b]\n";
	return s;
}

template<typename T>
ostream& operator <<(ostream &s, const pair<int, T> &c)
{
	s << "[ "; cout << c.fi << " , " << c.se << " ] ";
	return s;
}

const int maxn = 123456, mod = 1000000007;

#define fac_init() fact(maxn - 1, 1);
#define C(x,y) ((fact(x, 2) * fact(y, 3) % mod) * fact((x) - (y), 3) % mod)

int fact(int cur, int mode)
{
	static int f[maxn], g[maxn];
	if (mode == 1)
	{
		f[0] = 1;
		F1 (i, cur) f[i] = f[i - 1] * i % mod;
		g[cur] = 1;
		int a = f[cur], b = (mod - 2) << 1;
		while (b >>= 1)
		{
			if (b & 1) g[cur] = g[cur] * a % mod;
			a = a * a % mod;
		}
		for (int i = cur - 1; i >= 0; --i)
			g[i] = g[i + 1] * (i + 1) % mod;
		return 0;
	} else if (mode == 2) return f[cur];
	else return g[cur];
}

int t;
int n, m;
vector<pair<double, double> > in, out;
bool fu;

void input()
{
	ios::sync_with_stdio(false); cin.tie(0);
	cout << setprecision(20);
	cin >> t;
}

double calc(double x, double y)
{
	double lo = -1e18, hi = 1e18;
	for (auto c : out)
		lo = max(lo, 2 * c.fi * x + 2 * c.se * y - c.fi * c.fi - c.se * c.se);
	/*dbg(lo);
	for (auto cur : out)
		cout << cur.fi << ' ' << cur.se << '\n';*/
	for (auto c : in)
		hi = min(hi, 2 * c.fi * x + 2 * c.se * y - c.fi * c.fi - c.se * c.se);
	/*dbg(hi);
	for (auto cur : in)
		cout << cur.fi << ' ' << cur.se << '\n';*/
	if (hi > lo && fu == false)
	{
		fu = true;
		cout << sqrt(x * x + y * y - (hi + lo) / 2) << '\n';
		cout << x << ' ' << y << '\n';
	}
	return hi - lo;
}

double gao2(double x)
{
	double l = -1e9, r = 1e9;
	int t = 80;
	while (t --> 0)
	{
		double y1 = (l + l + r) / 3, y2 = (l + r + r) / 3;
		double c1 = calc(x, y1), c2 = calc(x, y2);
		if (c1 > 0 || c2 > 0) return max(c1, c2);
		if (c1 > c2) r = y2;
		else l = y1;
	}
	//dbg(calc(x, l));
	return calc(x, l);
}

void gao(double l, double r)
{
	int t = 80;
	while (t --> 0)
	{
		//dbgg(l);
		//dbg(r);
		double x1 = (l + l + r) / 3, x2 = (l + r + r) / 3;
		double c1 = gao2(x1), c2 = gao2(x2);
		if (c1 > 0 || c2 > 0) return;
		if (c1 > c2) r = x2;
		else l = x1;
	}
	return;
} 

void solve()
{
	while (t --> 0)
	{
		out.clear(); in.clear();
		fu = false;
		cin >> n;
		F1 (i, n)
		{
			int x, y; cin >> x >> y;
			out.pb(mp(x, y));
		}
		cin >> m;
		F1 (i, m)
		{
			int x, y; cin >> x >> y;
			in.pb(mp(x, y));
		}
		gao(-1e9, 1e9);
	}
}

main()
{
	fac_init();
	input();
	solve();
}