#include <bits/stdc++.h>

using namespace std;

int main() {
	int t;
	cin >> t;
	for (int i = 0; i < t; ++i) {
		int l1, r1, l2, r2;
		cin >> l1 >> r1 >> l2 >> r2;
		vector<int>a({l1, r1, l2, r2});
		int ans1 = 0, ans2 = 0;
		for (auto it : a) for (auto jt : a) {
			if (l1 <= it && it <= r1 && l2 <= jt && jt <= r2 && it != jt) {
				ans1 = it;
				ans2 = jt;
			}
		}
		cout << ans1 << " " << ans2 << endl;
	}
	
	return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main() {
#ifdef _DEBUG
	freopen("input.txt", "r", stdin);
//	freopen("output.txt", "w", stdout);
#endif
	
	int n;
	cin >> n;
	multiset<int> a;
	for (int i = 0; i < n; ++i) {
		int x;
		cin >> x;
		a.insert(x);
	}
	
	int x = *prev(a.end());
	for (int i = 1; i <= x; ++i) {
		if (x % i == 0) {
			a.erase(a.find(i));
		}
	}
	
	cout << x << " " << *prev(a.end()) << endl;
	
	return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main() {
#ifdef _DEBUG
	freopen("input.txt", "r", stdin);
//	freopen("output.txt", "w", stdout);
#endif
	
	int n;
	string s;
	cin >> n >> s;
	
	vector<int> p(3);
	iota(p.begin(), p.end(), 0);
	
	string colors = "RGB";
	string res = "";
	int ans = 1e9;
	
	do {
		string t;
		int cnt = 0;
		for (int i = 0; i < n; ++i) {
			t += colors[p[i % 3]];
			cnt += t[i] != s[i];
		}
		if (ans > cnt) {
			ans = cnt;
			res = t;
		}
	} while (next_permutation(p.begin(), p.end()));
	
	cout << ans << endl << res << endl;
	
	return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main() {
#ifdef _DEBUG
	freopen("input.txt", "r", stdin);
//	freopen("output.txt", "w", stdout);
#endif
	
	int n;
	string s;
	cin >> n >> s;
	
	int ans = 0;
	for (int i = 0; i < n; ++i) {
		int j = i;
		while (j < n && s[i] == s[j]) {
			++j;
		}
		string q = "RGB";
		q.erase(q.find(s[i]), 1);
		if (j < n) q.erase(q.find(s[j]), 1);
		for (int k = i + 1; k < j; k += 2) {
			++ans;
			s[k] = q[0];
		}
		i = j - 1;
	}
	
	cout << ans << endl << s << endl;
	
	return 0;
}

#include <bits/stdc++.h>

using namespace std;

mt19937 rnd(time(NULL));

const int INF = 1e9;

int main() {
#ifdef _DEBUG
	freopen("input.txt", "r", stdin);
//	freopen("output.txt", "w", stdout);
#endif
	
	int n, m;
	cin >> n >> m;
	vector<int> a(n);
	for (int i = 0; i < n; ++i) {
		cin >> a[i];
	}
	vector<pair<int, int>> b(m);
	for (int i = 0; i < m; ++i) {
		cin >> b[i].first >> b[i].second;
		--b[i].first;
		--b[i].second;
	}
	
	int ans = *max_element(a.begin(), a.end()) - *min_element(a.begin(), a.end());
	vector<int> res;
	for (int i = 0; i < n; ++i) {
		vector<int> add(n + 1);
		vector<int> cur;
		for (int j = 0; j < m; ++j) {
			if (!(b[j].first <= i && i <= b[j].second)) {
				cur.push_back(j);
				for (int k = b[j].first; k <= b[j].second; ++k) {
					--add[k];
				}
			}
		}
		int mn = INF, mx = -INF;
		for (int j = 0; j < n; ++j) {
			mn = min(mn, a[j] + add[j]);
			mx = max(mx, a[j] + add[j]);
		}
		if (ans < mx - mn) {
			ans = mx - mn;
			res = cur;
		}
	}
	
	cout << ans << endl << res.size() << endl;
	shuffle(res.begin(), res.end(), rnd);
	for (auto it : res) cout << it + 1 << " ";
	cout << endl;
	
	return 0;
}

#include <bits/stdc++.h>

using namespace std;

mt19937 rnd(time(NULL));

const int INF = 1e9;

int main() {
#ifdef _DEBUG
	freopen("input.txt", "r", stdin);
//	freopen("output.txt", "w", stdout);
#endif
	
	int n, m;
	cin >> n >> m;
	
	vector<int> a(n);
	for (int i = 0; i < n; ++i) {
		cin >> a[i];
	}
	vector<pair<int, int>> b(m);
	vector<vector<int>> lf(n), rg(n);
	for (int i = 0; i < m; ++i) {
		cin >> b[i].first >> b[i].second;
		--b[i].first;
		--b[i].second;
		lf[b[i].second].push_back(b[i].first);
		rg[b[i].first].push_back(b[i].second);
		}
	
	vector<int> ansv(n, -INF);
	
	vector<int> add(n + 1 , 0);
	int mn = a[0];
	
	for (int i = 0; i < n; ++i) {
		ansv[i] = max(ansv[i], a[i] - mn);
		for (auto l : lf[i]) {
			for (int j = l; j <= i; ++j) {
				--add[j];
				mn = min(mn, a[j] + add[j]);
			}
		}
		mn = min(mn, a[i] + add[i]);
	}
	
	add = vector<int>(n + 1, 0);
	mn = a[n - 1];
	
	for (int i = n - 1; i >= 0; --i) {
		ansv[i] = max(ansv[i], a[i] - mn);
		for (auto r : rg[i]) {
			for (int j = i; j <= r; ++j) {
				--add[j];
				mn = min(mn, a[j] + add[j]);
			}
		}
		mn = min(mn, a[i] + add[i]);
	}
	
	int ans = *max_element(ansv.begin(), ansv.end());
	vector<int> res;
	
	for (int i = 0; i < n; ++i) {
		if (ansv[i] == ans) {
			for (int j = 0; j < m; ++j) {
				if (!(b[j].first <= i && i <= b[j].second)) {
					res.push_back(j);
				}
			}
			break;
		}
	}
	
	cout << ans << endl << res.size() << endl;
	shuffle(res.begin(), res.end(), rnd);
	for (auto it : res) cout << it + 1 << " ";
	cout << endl;
	
	return 0;
}

#include <bits/stdc++.h>

using namespace std;

#define x first
#define y second

vector<int> p, rk;

int getp(int v) {
	if (v == p[v]) return v;
	return p[v] = getp(p[v]);
}

bool merge(int v, int u) {
	u = getp(u);
	v = getp(v);
	
	if (u == v) return false;
	
	if (rk[u] < rk[v]) swap(u, v);
	
	rk[u] += rk[v];
	p[v] = u;
	
	return true;
}

int main() {
#ifdef _DEBUG
	freopen("input.txt", "r", stdin);
//	freopen("output.txt", "w", stdout);
#endif
	
	ios_base::sync_with_stdio(0);
	int n, m;
	cin >> n >> m;
	
	p = vector<int>(n);
	iota(p.begin(), p.end(), 0);
	rk = vector<int>(n, 1);
	
	vector<pair<pair<int, int>, int>> e(m);
	for (int i = 0; i < m; ++i) {
		cin >> e[i].x.x >> e[i].x.y >> e[i].y;
		--e[i].x.x;
		--e[i].x.y;
	}
	
	sort(e.begin(), e.end(), [](pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {
		return a.y < b.y;
	});
	
	int ans = 0;
	for (int i = 0; i < m; ++i) {
		int j = i;
		while (j < m && e[i].y == e[j].y) {
			++j;
		}
		int cnt = j - i;
		for (int k = i; k < j; ++k) {
			if (getp(e[k].x.x) == getp(e[k].x.y)) {
				--cnt;
			}
		}
		for (int k = i; k < j; ++k) {
			cnt -= merge(e[k].x.x, e[k].x.y);
		}
		ans += cnt;
		i = j - 1;
	}
	
	cout << ans << endl;
	
	return 0;
}