CF1415A.Prison Break

There is a prison that can be represented as a rectangular matrix with $n$ rows and $m$ columns. Therefore, there are $n \cdot m$ prison cells. There are also $n \cdot m$ prisoners, one in each prison cell. Let's denote the cell in the $i$-th row and the $j$-th column as $(i, j)$.

There's a secret tunnel in the cell $(r, c)$, that the prisoners will use to escape! However, to avoid the risk of getting caught, they will escape at night.

Before the night, every prisoner is in his own cell. When night comes, they can start moving to adjacent cells. Formally, in one second, a prisoner located in cell $(i, j)$ can move to cells $( i - 1 , j )$ , $( i + 1 , j )$ , $( i , j - 1 )$ , or $( i , j + 1 )$, as long as the target cell is inside the prison. They can also choose to stay in cell $(i, j)$.

The prisoners want to know the minimum number of seconds needed so that every prisoner can arrive to cell $( r , c )$ if they move optimally. Note that there can be any number of prisoners in the same cell at the same time.

有一座监狱，可以表示为一个 $n$ 行 $m$ 列的矩形矩阵。因此，监狱中共有 $n \cdot m$ 个牢房。同时，也有 $n \cdot m$ 名囚犯，每人占据一个牢房。我们将第 $i$ 行第 $j$ 列的牢房记作 $(i, j)$。

在牢房 $(r, c)$ 中存在一条秘密隧道，囚犯们将通过它越狱！然而，为了避免被捕风险，他们将在夜间行动。

在夜幕降临前，每名囚犯均位于自己的牢房中。当夜晚来临时，他们可以开始向相邻牢房移动。形式上讲，在一秒内，位于牢房 $(i, j)$ 的囚犯可移动至牢房 $(i-1, j)$、$(i+1, j)$、$(i, j-1)$ 或 $(i, j+1)$，前提是目标牢房仍在监狱范围内。囚犯也可选择留在牢房 $(i, j)$ 中不动。

囚犯们希望知道：若所有人以最优方式移动，所有囚犯均抵达牢房 $(r, c)$ 所需的最少秒数是多少？注意：同一时刻，任意数量的囚犯可位于同一牢房中。

The first line contains an integer $t$ $(1 \le t \le 10^4)$, the number of test cases.

Each of the next $t$ lines contains four space-separated integers $n$, $m$, $r$, $c$ ($1 \le r \le n \le 10^9$, $1 \le c \le m \le 10^9$).

第一行包含一个整数 $t$（$1 \le t \le 10^4$），表示测试用例的数量。

接下来的 $t$ 行，每行包含四个以空格分隔的整数 $n$、$m$、$r$、$c$（$1 \le r \le n \le 10^9$，$1 \le c \le m \le 10^9$）。

Print $t$ lines, the answers for each test case.

输出 $t$ 行，每行对应一个测试用例的答案。