import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum INF = 10L^^18;

void main() {
  try {
    for (; ; ) {
      const numCases = readInt;
      foreach (caseId; 0 .. numCases) {
        long[2] A, B;
        foreach (i; 0 .. 2) {
          A[i] = readLong;
          B[i] = readLong;
        }
        
        long[][2] pss;
        foreach (i; 0 .. 2) {
          long d = B[i] - A[i];
          for (long p = 2; p * p <= d; ++p) if (d % p == 0) {
            pss[i] ~= p;
            do {
              d /= p;
            } while (d % p == 0);
          }
          if (d > 1) {
            pss[i] ~= d;
          }
        }
        debug {
          writeln("pss = ", pss);
        }
        
        long ansA, ansB;
        for (; ; ) {
          int i;
          if (B[0] - A[0] > B[1] - A[1]) {
            i = 0;
          } else if (B[0] - A[0] < B[1] - A[1]) {
            i = 1;
          } else if (A[0] < A[1]) {
            i = 0;
          } else if (A[0] > A[1]) {
            i = 1;
          } else {
            ansA = A[0];
            ansB = B[0];
            break;
          }
          long mn = INF;
          foreach (p; pss[i]) if ((B[i] - A[i]) % p == 0) {
            chmin(mn, p - A[i] % p);
          }
          if (B[0] - A[0] == B[1] - A[1] && A[i ^ 1] - A[i] < mn) {
            ansA = A[i ^ 1];
            ansB = B[i ^ 1];
            break;
          }
          assert(mn < INF);
          A[i] += mn;
          B[i] += mn;
          const g = gcd(A[i], B[i]);
          A[i] /= g;
          B[i] /= g;
        }
        writeln(ansA, " ", ansB);
      }
    }
  } catch (EOFException e) {
  }
}