#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int t;
ll x,y,a,b,c;
void ex_gcd(long long int al,long long int bl)
{
	if(bl==0LL)
	{
		x=1LL;y=0LL;return;
	}
	else
	{
		ex_gcd(bl,al%bl);
		long long tmp=x;
		x=y;y=tmp-y*(al/bl);
	}
}

int main() {
    cin.tie(nullptr) -> sync_with_stdio(false);

    ll x1,x2,y1,y2,x3,y3;
    cin>>t;
    while(t--)
    {
        cin>>x1>>y1>>x2>>y2;
        if(x1==x2)
        {
            cout<<x1+1LL<<" 1\n";
            continue;
        }
        if(y1==y2)
        {
            cout<<"1 "<<y1+1LL<<'\n';
            continue;
        }
        a=y1-y2;b=x2-x1;
        c=x2*y1-x1*y2;
        ll gcdk=gcd(abs(a),abs(b));
        a/=gcdk;b/=gcdk;
        ll num_l=c/gcdk;
        if(c%gcdk==0LL) num_l--;
        ll num_r=c/gcdk;
        if(c%gcdk==0LL) num_r++;

        ll sum1=c-num_l*gcdk;
        ll sum2=num_r*gcdk-c;
        ll num;
        if(sum1<=sum2) num=num_l;
        else num=num_r;

//        cerr<<a<<" "<<b<<" "<<c<<"  asd"<<endl;
        ex_gcd(a,b);
//         cerr<<x<<" "<<y<<" "<<c<<"  asd"<<endl;
        x*=num;y*=num;
        cout<<x<<" "<<y<<'\n';
    }
    return 0;
}