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

#define int long long  

int exgcd(int a, int b, int &x, int &y) {
    if (!b) {
        x = 1, y = 0;
        return a;
    }
    int g = exgcd(b, a % b, y, x);
    y -= a / b * x;
    return g;
}
// ax + by = c, 可求解线性同余方程 ax === b (mod c)
bool liEu(int a, int b, int c, int& x, int& y) {
    int d = exgcd(a, b, x, y);
    if (c % d != 0) 
        return false;
    int k = c / d;
    x *= k;
    y *= k;
    return true;
}

struct Point {
	int x, y;
};
Point operator+(Point a, Point b) {
	return {a.x + b.x, a.y + b.y};
}
Point operator-(Point a, Point b) {
	return {a.x - b.x, a.y - b.y};
}
int cross(Point a, Point b) {
	return a.x * b.y - a.y * b.x;
}
int area(Point a, Point b, Point c) {
	return abs(cross(b - a, c - a));
}

void solve() {
	Point a, b;
	cin >> a.x >> a.y;
	cin >> b.x >> b.y;

	Point d = b - a;
	Point t;
	exgcd(abs(d.x), abs(d.y), t.y, t.x);
	Point c;
	int mn = 1e18;
	for (auto x : {t.x, -t.x}) {
		for (auto y : {t.y, -t.y}) {
			int s = area(a, b, a + (Point){x, y});
			if (s != 0 && s < mn) {
				mn = s;
				c = a + (Point){x, y};
			}
		}
	}

	cout << c.x << " " << c.y << "\n";
}

signed main() {  
    ios::sync_with_stdio(false);
    cin.tie(nullptr);  

    int t;
    cin >> t;
    while (t--) {
    	solve();
    }

    return 0;
}