CF1610A.Anti Light's Cell Guessing

You are playing a game on a $n \times m$ grid, in which the computer has selected some cell $(x, y)$ of the grid, and you have to determine which one.

To do so, you will choose some $k$ and some $k$ cells $(x_1, y_1),\, (x_2, y_2), \ldots, (x_k, y_k)$, and give them to the computer. In response, you will get $k$ numbers $b_1,\, b_2, \ldots b_k$, where $b_i$ is the manhattan distance from $(x_i, y_i)$ to the hidden cell $(x, y)$ (so you know which distance corresponds to which of $k$ input cells).

After receiving these $b_1,\, b_2, \ldots, b_k$, you have to be able to determine the hidden cell. What is the smallest $k$ for which is it possible to always guess the hidden cell correctly, no matter what cell computer chooses?

As a reminder, the manhattan distance between cells $(a_1, b_1)$ and $(a_2, b_2)$ is equal to $|a_1-a_2|+|b_1-b_2|$.

你正在一个 $n \times m$ 的网格上进行一场游戏：计算机在网格中选定某个单元格 $(x, y)$，而你需要确定该单元格的具体位置。

为此，你需选定一个整数 $k$ 以及 $k$ 个单元格 $(x_1, y_1),\, (x_2, y_2), \ldots, (x_k, y_k)$，并将它们提交给计算机。作为回应，你将收到 $k$ 个整数 $b_1,\, b_2, \ldots, b_k$，其中 $b_i$ 表示 $(x_i, y_i)$ 到隐藏单元格 $(x, y)$ 的曼哈顿距离（因此你能明确知道每个 $b_i$ 对应于哪一个输入单元格）。

在收到这些 $b_1,\, b_2, \ldots, b_k$ 后，你必须能唯一确定隐藏单元格。问：使得无论计算机选择哪个单元格，你总能正确猜出该单元格的最小 $k$ 是多少？

提醒：单元格 $(a_1, b_1)$ 与 $(a_2, b_2)$ 之间的曼哈顿距离定义为 $|a_1-a_2|+|b_1-b_2|$。

The first line of the input contains a single integer $t$ ($1 \le t \le 10^4$) — the number of test cases. The description of test cases follows.

The single line of each test case contains two integers $n$ and $m$ ($1 \le n, m \le 10^9$) — the number of rows and the number of columns in the grid.

输入的第一行包含一个整数 $t$（$1 \le t \le 10^4$），表示测试用例的数量。随后是各测试用例的描述。

每个测试用例仅一行，包含两个整数 $n$ 和 $m$（$1 \le n, m \le 10^9$），分别表示网格的行数和列数。

For each test case print a single integer — the minimum $k$ for that test case.

对于每个测试用例，输出一个整数——该测试用例对应的最小 $k$ 值。

In the first test case, the smallest such $k$ is $2$, for which you can choose, for example, cells $(1, 1)$ and $(2, 1)$.

Note that you can't choose cells $(1, 1)$ and $(2, 3)$ for $k = 2$, as both cells $(1, 2)$ and $(2, 1)$ would give $b_1 = 1, b_2 = 2$, so we wouldn't be able to determine which cell is hidden if computer selects one of those.

In the second test case, you should choose $k = 1$, for it you can choose cell $(3, 1)$ or $(1, 1)$.

在第一个测试用例中，满足条件的最小 $k$ 为 $2$，此时你可以选择例如单元格 $(1, 1)$ 和 $(2, 1)$。

注意：当 $k = 2$ 时，你不能选择单元格 $(1, 1)$ 和 $(2, 3)$，因为此时单元格 $(1, 2)$ 和 $(2, 1)$ 都会给出 $b_1 = 1, b_2 = 2$，因此若计算机从中任选其一作为隐藏单元格，我们将无法确定具体是哪一个。

在第二个测试用例中，应选择 $k = 1$，此时你可以选择单元格 $(3, 1)$ 或 $(1, 1)$。