#include<iostream>
#include<cmath>
using namespace std;

const double EPS = 1e-8;
const double PI = acos(-1);
int sgn(const double x) {return x < -EPS ? -1 : x > EPS;}

int T;
struct Point {
    double x, y;
    Point (double x = 0, double y = 0) : x(x), y(y) {}
    Point operator-(const Point a) { return Point(x - a.x, y - a.y); }
    Point operator+(const Point a) { return Point(x + a.x, y + a.y); }
    Point operator * (const double r) {return Point (x * r, y * r);}
    double len() {return sqrt(x * x + y * y);}
    Point rotate(Point p, double ang) {
        Point v = (*this) - p;
        double c = cos(ang), s = sin(ang);
        return Point (p.x + v.x * c - v.y * s, p.y + v.x * s + v.y * c);
    }
}p[10];
double Cross(Point a, Point b) {return a.x * b.y - a.y * b.x;}
double Cross(Point a, Point b, Point c) {return Cross(b - a, c - a);}
double Dot(Point a, Point b) {return a.x * b.x + a.y * b.y;}
double Dot(Point a, Point b, Point c) { return Dot(b - a, c - a); }

int main() {
    scanf("%d", &T);
    while (T--) {
        for (int i = 1; i <= 8; i++)  
            scanf("%lf%lf", &p[i].x, &p[i].y);
        double ang1 = acos(Dot(p[1], p[2], p[5]) / (p[5] - p[1]).len() / (p[2] - p[1]).len());
        double rat1 = (p[5] - p[1]).len() / (p[2] - p[1]).len();
        int dir1 = sgn(Cross(p[1], p[2], p[5]));
        double ang2 = acos(Dot(p[2], p[1], p[6]) / (p[6] - p[2]).len() / (p[1] - p[2]).len());
        double rat2 = (p[6] - p[2]).len() / (p[1] - p[2]).len();
        int dir2 = sgn(Cross(p[2], p[1], p[6]));

        int Time = 1000;
        Point p1 = p[5], p2 = p[6];
        while (Time--) {
            Point tp1 = (p2 - p1) * rat1;
            tp1 = tp1.rotate(Point(0, 0), dir1 >= 0 ? ang1 : 2 * PI - ang1) + p1;
            Point tp2 = (p1 - p2) * rat2;
            tp2 = tp2.rotate(Point(0, 0), dir2 >= 0 ? ang2 : 2 * PI - ang2) + p2;
            p1 = tp1;
            p2 = tp2;
        }
        printf("%lf %lf", p1.x, p1.y);
    }

    return 0;
}