#include<bits/stdc++.h>
using namespace std;
#define il inline
#define fi first
#define se second
#define mk make_pair
#define eb emplace_back
#define rep(i,l,r) for(int i=(l); i<=(r); ++i)
#define rep_(i,l,r) for(int i=(l); i>=(r); --i)
typedef long long lr;
typedef double db;
typedef pair<int,int> pii;
typedef vector<int> vi;
constexpr int mod1=998244353,mod2=1e9+7;
constexpr db pi=3.141592653589793,eps=1e-9;
constexpr int inf32=0x3f3f3f3f,Inf32=0xc0c0c0c0;
constexpr lr inf64=0x3f3f3f3f3f3f3f3f,Inf64=0xc0c0c0c0c0c0c0c0;
template<typename T>il T Max(T x,T y) { return (x>y)? x:y; }
template<typename T>il T Min(T x,T y) { return (x<y)? x:y; }
template<typename T>il T gcd(T x,T y) { return (!y)? x:gcd(y,x%y); }
template<typename T>il T Abs(T x) { return (x>0)? x:(-x); }
template<typename T>il T Rnd(T l,T r,mt19937_64 &eng)
{
	uniform_int_distribution<T> uid(l,r);
	return uid(eng);
}
mt19937_64 eng(chrono::high_resolution_clock::now().time_since_epoch().count());
constexpr int N=524300;
il db cross(db xa,db ya,db xb,db yb,db xc,db yc) { return Abs((xa-xc)*(yb-yc)-(xb-xc)*(ya-yc)); }
db tmp;
il bool chk(int xa,int ya,int xb,int yb,int x,int y)
{
	if((x<xa&&x<xb)||(x>xa&&x>xb)||(y<ya&&y<yb)||(y>ya&&y>yb))
		return 0;
	return (lr)(x-xa)*(yb-ya)==(lr)(y-ya)*(xb-xa);
}
il void calc(int xa,int ya,int xb,int yb,int xl,int yl,int xr,int yr)
{
	if(xl==xr)
	{
		db l=yl,r=yr,mid,ax=0,ay=0;
		while(Abs(r-l)>eps)
		{
			mid=(l+r)*0.5;
			db xc=xl,yc=mid;
			if(cross(xa,ya,xb,yb,xc,yc)*2>=tmp)
				ax=xc,ay=yc,(l<r)? (r=mid-eps):(r=mid+eps);
			else
				(l<r)? (l=mid+eps):(l=mid-eps);
		}
		cout<<setiosflags(ios::fixed)<<setprecision(6)<<ax<<' '<<ay<<'\n';
		return;
	}
	db l=xl,r=xr,mid,ax=0,ay=0;
	while(Abs(r-l)>eps)
	{
		mid=(l+r)*0.5;
		db xc=mid,yc=(yl*(xr-xc)+yr*(xc-xl))/(xr-xl);
		if(cross(xa,ya,xb,yb,xc,yc)*2>=tmp)
			ax=xc,ay=yc,(l<r)? (r=mid-eps):(r=mid+eps);
		else
			(l<r)? (l=mid+eps):(l=mid-eps);
	}
	cout<<setiosflags(ios::fixed)<<setprecision(6)<<ax<<' '<<ay<<'\n';
}
int xa,ya,xb,yb,xc,yc,xp,yp;
il void Solve()
{
	cin>>xa>>ya>>xb>>yb>>xc>>yc>>xp>>yp,tmp=cross(xa,ya,xb,yb,xc,yc);
	if(chk(xa,ya,xb,yb,xp,yp))
	{
		if(xa==xb)
		{
			int ap=Abs(yp-ya),bp=Abs(yp-yb);
			if(ap>bp)
				return calc(xa,ya,xp,yp,xa,ya,xc,yc);
			else
				return calc(xb,yb,xp,yp,xb,yb,xc,yc);
		}
		int ap=Abs(xp-xa),bp=Abs(xp-xb);
		if(ap>bp)
			return calc(xa,ya,xp,yp,xa,ya,xc,yc);
		else
			return calc(xb,yb,xp,yp,xb,yb,xc,yc);
	}
	if(chk(xa,ya,xc,yc,xp,yp))
	{
		if(xa==xc)
		{
			int ap=Abs(yp-ya),cp=Abs(yp-yc);
			if(ap>cp)
				return calc(xa,ya,xp,yp,xa,ya,xb,yb);
			else
				return calc(xc,yc,xp,yp,xc,yc,xb,yb);
		}
		int ap=Abs(xp-xa),cp=Abs(xp-xc);
		if(ap>cp)
			return calc(xa,ya,xp,yp,xa,ya,xb,yb);
		else
			return calc(xc,yc,xp,yp,xc,yc,xb,yb);
	}
	if(chk(xb,yb,xc,yc,xp,yp))
	{
		if(xb==xc)
		{
			int bp=Abs(yp-yb),cp=Abs(yp-yc);
			if(bp>cp)
				return calc(xb,yb,xp,yp,xb,yb,xa,ya);
			else
				return calc(xc,yc,xp,yp,xc,yc,xa,ya);
		}
		int bp=Abs(xp-xb),cp=Abs(xp-xc);
		if(bp>cp)
			return calc(xb,yb,xp,yp,xb,yb,xa,ya);
		else
			return calc(xc,yc,xp,yp,xc,yc,xa,ya);
	}
	cout<<"-1\n";
}
int main()
{
#ifdef LOCAL
	string fpre="test",isuf="in",osuf="out";
	assert(freopen((fpre+"."+isuf).c_str(),"r",stdin));
	assert(freopen((fpre+"."+osuf).c_str(),"w",stdout));
#endif
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int T;
	cin>>T;
	while(T--)
		Solve();
	return 0;
}