#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int T;
ll P1,Q1,P2,Q2;

const int prime_max = 32000;
vector<int> prime;
int NP,divp[prime_max];

void cprime() {
	if(NP) return;
	for(int i=2;i<prime_max;i++) if(divp[i]==0) {
		//M[i]=NP;
		prime.push_back(i); NP++;
		for(ll j=1LL*i*i;j>=i&&j<prime_max;j+=i) if(divp[j]==0) divp[j]=i;
	}
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cprime();
	
	cin>>T;
	while(T--) {
		cin>>P1>>Q1>>P2>>Q2;
		while(P1!=P2||Q1!=Q2) {
			if(Q1-P1<Q2-P2) swap(P1,P2),swap(Q1,Q2);
			if(Q1-P1==Q2-P2&&P1>P2) swap(P1,P2),swap(Q1,Q2);
			//cout<<P1<<" "<<Q1<<" "<<P2<<" "<<Q2<<endl;
			ll D=Q1-P1;
			ll cand=D-(Q1%D);
			if(D==1) cand=1LL<<30;
			
			if(Q1-P1==Q2-P2) {
				ll a=Q2-P2;
				ll b=Q1*P2-P1*Q2;
				cand=min(cand,(b+a-1)/a);
			}
			
			FORR(p,prime) if(D%p==0) {
				cand=min(cand,p-Q1%p);
			}
			ll g=__gcd(P1+cand,Q1+cand);
			P1=(P1+cand)/g;
			Q1=(Q1+cand)/g;
			
		}
		cout<<max(P1,P2)<<" "<<max(Q1,Q2)<<endl;
	}
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}