#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using lll = __int128;

ll dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
ll dy[] = {0, 0, 1, -1 ,1, 1, -1, -1};

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

    vector<array<lll, 3> > a;
    for (int i = 0; i < 8; ++i) {
        ll x = x1 + dx[i];
        ll y = y1 + dy[i];
        ll X1 = x1 - x, Y1 = y1 - y;
        ll X2 = x2 - x, Y2 = y2 - y;
        lll S = X1 * Y2 - X2 * Y1;
        if (S < 0) S = -S;
        if (S) {
            a.push_back({S, x, y});
        }
    }
    for (int i = 0; i < 8; ++i) {
        ll x = x2 + dx[i];
        ll y = y2 + dy[i];
        ll X1 = x1 - x, Y1 = y1 - y;
        ll X2 = x2 - x, Y2 = y2 - y;
        lll S = X1 * Y2 - X2 * Y1;
        if (S < 0) S = -S;
        if (S) {
            a.push_back({S, x, y});
        }
    }

    lll minn = a[0][0];
    ll ansx = a[0][1], ansy = a[0][2];
    for (int i = 1; i < ssize(a); ++i) {
        if (a[i][0] < minn) {
            minn = a[i][0];
            ansx = a[i][1];
            ansy = a[i][2];
        }
    }

    cout << ansx << " " << ansy << "\n";
}

int main() {
    cin.tie(nullptr) -> sync_with_stdio(false);

    int _;
    cin >> _;
    while (_--) solve();

    return 0;
}