#include <bits/stdc++.h>
using namespace std;
using LL = long long;

template<typename T>
T exgcd(T a, T b, T &x, T &y){
    if (!b){
        x = 1, y = 0;
        return a;
    }
    T r = exgcd(b, a % b, y, x);
    y -= a / b * x;
    return r;
}

// a * x = b (mod m) or b / a (mod m)
array<LL, 2> modequ(LL a, LL b, LL m){
    LL x, y;
    LL g = exgcd(a, m, x, y);
    if (b % g) return {-1, -1};
    m /= g, a /= g, b /= g;
    x = 1LL * x * b % m;
    if (x < 0) x += m;
    return {x, m};
}

int sgn(LL x) {
    if (x > 0) {
        return 1;
    } else if (x < 0) {
        return -1;
    } else {
        return 0;
    }
}

void solve() {
    LL x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;

    if (x1 == x2) {
        cout << x1 + 1 << ' ' << y1 << '\n';
        return;
    }
    if (y1 == y2) {
        cout << x1 << ' ' << y1 + 1 << '\n';
        return;
    }

    LL dx = abs(x2 - x1), dy = abs(y2 - y1);

    if (dx == dy) {
        cout << x1 + 1 << ' ' << y1 << '\n';
        return;
    }

    LL g = gcd(dx, dy);
    dx /= g, dy /= g;

    auto [x, m] = modequ(dy, 1LL, dx);

    LL t = (y1 + x * (y2 - y1) / (x2 - x1)); 

    cout << x1 + sgn(x2 - x1) * x << ' ' << t << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}