#include<bits/stdc++.h>
using namespace std;
const int N=1919810;
#define x1 aufhhakjs
#define x2 aiufqkjefbqkjf
#define y1 aifajskfnakjfkk
#define y2 aufhajksfkajbfwqf
typedef long long ll;
typedef pair<ll,ll> PII;
ll n,m,k;
ll a[N],b[N];
char s[N];

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


void testify(__int128 xx){
    if(xx<-1e18||xx>1e18) assert(0);
}


bool check(__int128 xx){
    if(xx<-1e18||xx>1e18) return false;
    return true;
}

void __(){
    ll x1,y1,x2,y2;
    scanf("%lld%lld%lld%lld",&x1,&y1,&x2,&y2);
    // cout<<x1<<" "<<y1<<endl;
    ll fz=y2-y1,fm=x2-x1;
    // cout<<fz<<" "<<fm<<endl;
    fm=-fm;
    if(y1==y2){
        printf("%lld %lld\n",x1,y1-1);
        return;
    }
    if(x1==x2){
        printf("%lld %lld\n",x1+1,y1);
        return;
    }
    if(fz<0){
        fz=-fz;
        fm=-fm;
    }
    ll MX=1e18,MN=-1e18;
    ll gg=__gcd(fz,fm);
    ll c=fz*x1+fm*y1;
    ll ax1,ax2,ay1,ay2;
    ll x,y;
    exgcd(fz/gg,abs(fm/gg),x,y);
    __int128 xx,yy,cm;
    fz/=gg,fm/=gg;
    cm=fz*fm;
    ll cc=c/gg+1;
    xx=x,y=yy;
    xx*=cc;
    xx%=cm;
    yy=(cc-fz*xx)/fm;

    while(!check(xx)||!check(yy)){
        if(xx<MN){
            __int128 ad=(MN-xx+fm-1)/fm;
            xx+=ad*fm;
            // yy-=ad*fz;
            yy=(cc-fz*xx)/fm;
        }
        if(xx>MX){
            __int128 mn=(xx-MX+fm-1)/fm;
            xx-=mn*fm;
            yy=(cc-fz*xx)/fm;
        }

        if(yy<MN){
            __int128 ad=(MN-yy+fz-1)/fz;
            yy+=ad*fz;
            xx=(cc-fm*yy)/fz;
        }
        if(yy>MX){
            __int128 mn=(yy-MX+fz-1)/fz;
            yy-=mn*fz;
            xx=(cc-fm*yy)/fz;
        }
    }


    printf("%lld %lld\n",(ll)xx,(ll)yy);
    testify(xx);
    testify(yy);
    // cout<<fz<<" "<<fm<<endl;
    // cout<<x*fz+y*fm<<" "<<fz+fm<<endl;
}


int main(){
    int _=1;
    cin>>_;
    while(_--){
        __();
    }
}