#include <bits/stdc++.h>
#define int long long
using namespace std;
#define PII pair<int,int>
#define x first
#define y second
int n, m;

void solve () {
    vector<pair<int,int>>p(2);
    for(int i=0;i<2;i++){
        cin>>p[i].first>>p[i].second;
    }
    sort(p.begin(),p.end(),[](PII a,PII b){
        return a.x<b.x||a.x==b.x&&a.y<b.y;
    });
    PII a=p[0],b=p[1];
    if(a.x==b.x){
        cout<<a.x+1<<" "<<a.y<<endl;
        return ;
    }
    else if(a.y==b.y){
        cout<<a.x<<" "<<a.y+1<<endl;
        return ;
    }
    auto fy=[&](int x)->int{
        {}
        return (a.y*(b.x-a.x)-a.x*(b.y-a.y)+x*(b.y-a.y))/(b.x-a.x);
    };
    if(a.y>b.y){
        int gc=gcd((b.x-a.x),(a.y-b.y));
        if(gc==(b.x-a.x)){
            cout<<a.x<<" "<<a.y-1<<endl;return ;
        }
        int l = a.x, r = a.x+(b.x-a.x)/(gc)-1;
        int ans1, ans2;
        auto f=[&](int x)->int{
            {}
            int yy=fy(x)-b.y;
            return x+yy-a.x;
        };
        while (l < r)
        {
            int mid1 = l + (r - l) / 3;
            int mid2 = r - (r - l) / 3;
            ans1 = f(mid1), ans2 = f(mid2);
            if (ans1 >= ans2)r = mid2 - 1; // 极大值
            else l = mid1 + 1;
        }
        cout<<l<<" "<<fy(l)<<endl;
    } 
    else{
        int gc=gcd(abs(b.x-a.x),abs(a.y-b.y));

        if(gc==abs(b.x-a.x)){
            cout<<a.x+1<<" "<<a.y<<endl;return ;
        }
        int l = a.x+1, r = a.x+(b.x-a.x)/(gc);
        int ans1, ans2;
        auto f=[&](int x)->int{
            {}
            int yy=fy(x)-a.y;
            return b.x-x+yy;
        };
        while (l < r)
        {
            int mid1 = l + (r - l) / 3;
            int mid2 = r - (r - l) / 3;
            ans1 = f(mid1), ans2 = f(mid2);
            if (ans1 >= ans2)r = mid2 - 1; // 极大值
            else l = mid1 + 1;
        }
        cout<<l<<" "<<fy(l)<<endl;
    }
}
signed main () {
    int T = 1; 
    std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    cin>>T;
    while (T --) solve ();
    return 0;
}