CF1900B.Laura and Operations

Laura is a girl who does not like combinatorics. Nemanja will try to convince her otherwise.

Nemanja wrote some digits on the board. All of them are either $1$, $2$, or $3$. The number of digits $1$ is $a$. The number of digits $2$ is $b$ and the number of digits $3$ is $c$. He told Laura that in one operation she can do the following:

• Select two different digits and erase them from the board. After that, write the digit ($1$, $2$, or $3$) different from both erased digits.

For example, let the digits be $1$, $1$, $1$, $2$, $3$, $3$. She can choose digits $1$ and $3$ and erase them. Then the board will look like this $1$, $1$, $2$, $3$. After that, she has to write another digit $2$, so at the end of the operation, the board will look like $1$, $1$, $2$, $3$, $2$.

Nemanja asked her whether it was possible for only digits of one type to remain written on the board after some operations. If so, which digits can they be?

Laura was unable to solve this problem and asked you for help. As an award for helping her, she will convince Nemanja to give you some points.

劳拉是一个不喜欢组合数学的女孩。内马尼亚想说服她改变看法。

内马尼亚在黑板上写了一些数字，这些数字只可能是 $1$、$2$ 或 $3$。其中数字 $1$ 的个数为 $a$，数字 $2$ 的个数为 $b$，数字 $3$ 的个数为 $c$。他告诉劳拉：在一次操作中，她可以执行以下步骤：

• 选择两个不同的数字，并将它们从黑板上擦除；然后，在黑板上写下既不同于第一个也不同于第二个的那一个数字（即剩下的那个在 $\{1,2,3\}$ 中未被选中的数字）。

例如，假设黑板上的数字为 $1$, $1$, $1$, $2$, $3$, $3$。她可以选择数字 $1$ 和 $3$ 并将它们擦除，此时黑板变为 $1$, $1$, $2$, $3$；接着她必须写下另一个数字 $2$，因此该次操作结束后，黑板上的数字为 $1$, $1$, $2$, $3$, $2$。

内马尼亚问她：经过若干次这样的操作后，是否可能使黑板上只剩下同一种数字？如果可能，这种数字可以是哪几种？

劳拉无法解决这个问题，于是向你求助。作为对她提供帮助的奖励，她会说服内马尼亚给你一些分数。

Each test contains multiple test cases. The first line contains the number of test cases $t$ ($1 \le t \le 10^5$). The description of the test cases follows.

The first and only line of each test case contains three integers $a$, $b$, $c$ ($1 \le a, b, c \le 100$) — the number of ones, number of twos, and number of threes, respectively.

每个测试包含多个测试用例。第一行包含测试用例的数量 $t$（$1 \le t \le 10^5$）。随后是各测试用例的描述。

每个测试用例仅有一行，包含三个整数 $a$、$b$、$c$（$1 \le a, b, c \le 100$），分别表示数字 1、2 和 3 的个数。

For each test case, output one line containing $3$ integers.

The first one should be $1$ if it is possible that after some operations only digits $1$ remain on the board, and $0$ otherwise.

Similarly, the second one should be $1$ if it is possible that after some operations only digits $2$ remain on the board, and $0$ otherwise.

Similarly, the third one should be $1$ if it is possible that after some operations only digits $3$ remain on the board, and $0$ otherwise.

对于每个测试用例，输出一行，包含 $3$ 个整数。

第一个整数：若存在某种操作序列使得最终黑板上仅剩下数字 $1$，则为 $1$，否则为 $0$。

第二个整数：若存在某种操作序列使得最终黑板上仅剩下数字 $2$，则为 $1$，否则为 $0$。

第三个整数：若存在某种操作序列使得最终黑板上仅剩下数字 $3$，则为 $1$，否则为 $0$。

In the first test case, Laura can remove digits $2$ and $3$ and write digit $1$. After that, the board will have $2$ digits $1$. She can make it have only digits $2$ or $3$ left by performing a similar operation.

In the second test case, she can remove digits $1$ and $3$ and write a digit $2$. After performing that operation $2$ times, the board will have only digits $2$ left. It can be proven that there is no way to have only digits $1$ or only digits $3$ left.

In the third test case, there is a sequence of operations that leaves only digits $1$ on the board. It can be proven that there is no way to have only digits $2$ or only digits $3$ left.

在第一个测试用例中，Laura 可以移除数字 $2$ 和 $3$，并写入数字 $1$。此后，黑板上将剩下两个数字 $1$。她可通过执行类似的操作，使黑板上最终仅剩数字 $2$ 或仅剩数字 $3$。

在第二个测试用例中，她可以移除数字 $1$ 和 $3$，并写入数字 $2$。执行该操作 $2$ 次后，黑板上将仅剩数字 $2$。可以证明：不存在任何方式使黑板上最终仅剩数字 $1$ 或仅剩数字 $3$。

在第三个测试用例中，存在一系列操作，可使黑板上最终仅剩数字 $1$。可以证明：不存在任何方式使黑板上最终仅剩数字 $2$ 或仅剩数字 $3$。