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

#define int long long

int T, x1, y1, x2, y2;

void exgcd(int &x,int &y,int a,int b) {
    if(!b) {
        x=1;
        y=0;
        return;
    }
    exgcd(x,y,b,a%b);
    int t=x;
    x=y;
    y=t-a/b*y;
}

signed main()
{
	cin >> T;
	while (T--) {
		cin >> x1 >> y1 >> x2 >> y2;
		int a = x2 - x1;
		int b = y2 - y1;
		int x, y;
		exgcd(x, y, -b, a);
		
		int t = b / __gcd(a, b);
		if (x <= 0) {
			int xx = (x % t) + t;
			int s = (xx - x) / t;
			int yy = y - (a / __gcd(a, b)) * s;
			x = xx, y = yy;
		}
		
		cout << x + x1 << ' ' << y + y1 << endl;
	}
	return 0;
}