#include <bits/stdc++.h>
#define ll long long
using namespace std;

const int N = 5e5 + 50;

int T = 1;
pair<int,int> a[10], b[10];

ll p2 (ll x) {
    return x * x;
}

ll dist2 (pair<int,int> x, pair<int,int> y) {
    ll res = (x.first - y.first) * (ll)(x.first - y.first);
    res += (x.second - y.second) * (ll)(x.second - y.second);
    return res;
}

void solve () {
    for (int i = 0; i < 4; i ++) 
        scanf ("%d%d", &a[i].first, &a[i].second);
    for (int i = 0; i < 4; i ++) 
        scanf ("%d%d", &b[i].first, &b[i].second);

    ll da = dist2 (a[0], a[1]), db = dist2 (b[0], b[1]);
    // printf("%lld %lld\n", da / __gcd (da, db), db / __gcd (da, db));

    ll a1 = 2ll * (a[3].first - a[0].first) * db 
            - 2ll * (b[3].first - b[0].first) * da;
    ll b1 = 2ll * (a[3].second - a[0].second) * db 
            - 2ll * (b[3].second - b[0].second) * da;
    ll c1 = (p2(a[0].first) + p2(a[0].second) - p2(a[3].first) - p2(a[3].second)) * db
            - (p2(b[0].first) + p2(b[0].second) - p2(b[3].first) - p2(b[3].second)) * da;
    
    ll a2 = 2ll * (a[0].first - a[2].first) * db 
            - 2ll * (b[0].first - b[2].first) * da;
    ll b2 = 2ll * (a[0].second - a[2].second) * db 
            - 2ll * (b[0].second - b[2].second) * da;
    ll c2 = (p2(a[2].first) + p2(a[2].second) - p2(a[0].first) - p2(a[0].second)) * db
            - (p2(b[2].first) + p2(b[2].second) - p2(b[0].first) - p2(b[0].second)) * da;

    // ll d = __gcd (a1, b1);
    // printf("%lld %lld %lld\n", a1 / d, b1 / d, c1 / d);
    // d = __gcd (a2, b2);
    // printf("%lld %lld %lld\n", a2 / d, b2 / d, c2 / d);

    double y = -1.0 * (c1 * a2 - c2 * a1) / (b1 * a2 - b2 * a1);
    double x = -1.0 * (c1 * b2 - c2 * b1) / (a1 * b2 - a2 * b1);

    printf("%.9f %.9f\n", x, y);
}

int main () {
#ifdef LOCAL
    freopen ("in.in", "r", stdin);
    freopen ("out.out", "w", stdout);
#endif
    scanf ("%d", &T);
    while (T --) {
        solve ();
    }
    return 0;
}