CF1108A.Two distinct points

You are given two segments $[l_1; r_1]$ and $[l_2; r_2]$ on the $x$-axis. It is guaranteed that $l_1 \lt r_1$ and $l_2 \lt r_2$. Segments may intersect, overlap or even coincide with each other.

The example of two segments on the $x$-axis.

Your problem is to find two integers $a$ and $b$ such that $l_1 \le a \le r_1$, $l_2 \le b \le r_2$ and $a \ne b$. In other words, you have to choose two distinct integer points in such a way that the first point belongs to the segment $[l_1; r_1]$ and the second one belongs to the segment $[l_2; r_2]$.

It is guaranteed that the answer exists. If there are multiple answers, you can print any of them.

You have to answer $q$ independent queries.

给定 $x$ 轴上的两个线段 $[l_1; r_1]$ 和 $[l_2; r_2]$。保证 $l_1 \lt r_1$ 且 $l_2 \lt r_2$。这两个线段可能相交、重叠，甚至完全重合。

$x$ 轴上两个线段的示例。

你的任务是找出两个整数 $a$ 和 $b$，满足 $l_1 \le a \le r_1$，$l_2 \le b \le r_2$，且 $a \ne b$。换言之，你需要选择两个互不相同的整数点，使得第一个点位于线段 $[l_1; r_1]$ 上，第二个点位于线段 $[l_2; r_2]$ 上。

题目保证答案一定存在。若存在多个可行解，输出任意一个即可。

你需要回答 $q$ 个相互独立的查询。

The first line of the input contains one integer $q$ ($1 \le q \le 500$) — the number of queries.

Each of the next $q$ lines contains four integers $l_{1_i}, r_{1_i}, l_{2_i}$ and $r_{2_i}$ ($1 \le l_{1_i}, r_{1_i}, l_{2_i}, r_{2_i} \le 10^9, l_{1_i} \lt r_{1_i}, l_{2_i} \lt r_{2_i}$) — the ends of the segments in the $i$-th query.

输入的第一行包含一个整数 $q$（$1 \le q \le 500$），表示查询次数。

接下来的 $q$ 行，每行包含四个整数 $l_{1_i}, r_{1_i}, l_{2_i}$ 和 $r_{2_i}$（$1 \le l_{1_i}, r_{1_i}, l_{2_i}, r_{2_i} \le 10^9$，且 $l_{1_i} \lt r_{1_i}$，$l_{2_i} \lt r_{2_i}$），表示第 $i$ 次查询中两个区间的端点。

Print $2q$ integers. For the $i$-th query print two integers $a_i$ and $b_i$ — such numbers that $l_{1_i} \le a_i \le r_{1_i}$, $l_{2_i} \le b_i \le r_{2_i}$ and $a_i \ne b_i$. Queries are numbered in order of the input.

It is guaranteed that the answer exists. If there are multiple answers, you can print any.

输出 $2q$ 个整数。对于第 $i$ 个查询，输出两个整数 $a_i$ 和 $b_i$，满足 $l_{1_i} \le a_i \le r_{1_i}$、$l_{2_i} \le b_i \le r_{2_i}$，且 $a_i \ne b_i$。查询按输入顺序编号。

保证答案存在。若存在多个答案，输出任意一个即可。