for _ in range(int(input())):
l1, r1, l2, r2 = [int(i) for i in input().split()]
if l1 != l2:
print(l1, l2)
else:
print(r1, l2)
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define str string
#define sz size()
#define All(s) s.begin(), s.end()
#define super ios::sync_with_stdio(0)
#define superin cin.tie(0)
#define fir(x,n) for(ll i = x; i < n; i++)
#define fir1(x,n) for(ll i = x; i <= n; i++)
const char nl = '\n';
const str ss = " ";
const int MX = 1000001;
void slove(){
int a,b,c,d; cin>>a>>b>>c>>d;
int mn(0), mx(0);
mn = min(a,b); mx = max(c,d);
mn++; mx--;
if(mn == mx)mx++;
cout<<mn<<ss<<mx<<nl;
}
int main(){
super; superin;
int t; cin>>t; while(t--){
slove();
}
}
115A - Party | 746B - Decoding |
1424G - Years | 1663A - Who Tested |
1073B - Vasya and Books | 195B - After Training |
455A - Boredom | 1099A - Snowball |
1651D - Nearest Excluded Points | 599A - Patrick and Shopping |
237A - Free Cash | 1615B - And It's Non-Zero |
1619E - MEX and Increments | 34B - Sale |
1436A - Reorder | 1363C - Game On Leaves |
1373C - Pluses and Minuses | 1173B - Nauuo and Chess |
318B - Strings of Power | 1625A - Ancient Civilization |
864A - Fair Game | 1663B - Mike's Sequence |
448A - Rewards | 1622A - Construct a Rectangle |
1620A - Equal or Not Equal | 1517A - Sum of 2050 |
620A - Professor GukiZ's Robot | 1342A - Road To Zero |
1520A - Do Not Be Distracted | 352A - Jeff and Digits |