#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
#define int LL
typedef pair<int, int> PII;
const int N = 1e5 + 5;
const int INF = 0x3f3f3f3f;
const int inf = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1.0);
const double eps = 1e-9;
const int MOD = 1e9 + 7;

typedef complex<double> cd;
int n;
cd a[110][110];
void Debug()
{
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n + 1; j++)
            cout << a[i][j] << " ";
        cout << endl;
    }
}
int gauss()
{
//    Debug();
//    cout<<"alsfh\n";
    int r, c;//行，列
    for (c = 1, r = 1; c <= n; c++) {
        int t = r;
        for (int i = r; i <= n; i++) {
            if (fabs(a[i][c]) > fabs(a[t][c])) t = i;
        }
        if (fabs(a[t][c]) < eps) continue;//用于下面判断解的情况
        for (int i = c; i <= n + 1; i++) swap(a[t][i], a[r][i]);
        for (int i = n + 1; i >= c; i--) a[r][i] /= a[r][c];
        for (int i = r + 1; i <= n; i++) {
            if (fabs(a[i][c]) > eps) {
                for (int j = n + 1; j >= c; j--) a[i][j] -= a[r][j] * a[i][c];//目的为了把第r的第c个数变为0
            }
        }
        r++;
    }
    if (r <= n) {
        for (int i = r; i <= n; i++) {
            if (fabs(a[i][n + 1]) > eps) return 2;//无解，出现0 = b情况
        }
        return 1;//无穷多解
    }
    for (int i = n; i >= 1; i--) {
        for (int j = i + 1; j <= n; j++) a[i][n + 1] -= a[i][j] * a[j][n + 1];
    }
    return 0;//有单组解
}
/*
for (int i = 1; i <= n; i++) {
		printf("%.2lf\n", a[i][n + 1]);
	}
*/
cd z[4], w[4];
void solve()
{
    n = 3;
    for (int i = 1; i <= 3; i++) {
        double za, zb, zc, zd;
        cin >> za >> zb >> zc >> zd;
        z[i].real(za);
        z[i].imag(zb);
        w[i].real(zc);
        w[i].imag(zd);
    }
    double x0, y0;
    cin >> x0 >> y0;
    z[0].real(x0), z[0].imag(y0);
    for (int i = 1; i <= 3; i++) {
        a[i][1] = z[i];
        a[i][2] = {1, 0};
        a[i][3] = -w[i];
        a[i][4] = z[i] * w[i];
    }
    cd ans;
    cd aa = (w[1] - w[2]) / (z[1] - z[2]);
    cd bb = w[1] - aa * z[1];
    if (fabs(aa * z[3] + bb - w[3]) < eps) {
        ans = aa * z[0] + bb;
//        cout << "ashf\n";
    }
    else {
        gauss();
        cd cc = {1, 0};
        ans = a[1][4] * z[0] + a[2][4];
        ans /= (cc * z[0] + a[3][4]);
    }
    cout << ans.real() << " " << ans.imag() << "\n";
}

signed main()
{
    ios::sync_with_stdio(false), cin.tie(0);
    cout << fixed << setprecision(15);
    int _;
    cin >> _;
//    _ = 1;
    while (_--) {
        solve();
    }
    return 0;
}