CF1873A.Short Sort

There are three cards with letters $\texttt{a}$, $\texttt{b}$, $\texttt{c}$ placed in a row in some order. You can do the following operation at most once:

• Pick two cards, and swap them.

Is it possible that the row becomes $\texttt{abc}$ after the operation? Output "YES" if it is possible, and "NO" otherwise.

有三张分别印有字母 $\texttt{a}$、$\texttt{b}$、$\texttt{c}$ 的卡片，以某种顺序排成一行。你最多可以执行以下操作一次：

• 任选两张卡片并交换它们的位置。

是否可能通过该操作使卡片排列变为 $\texttt{abc}$？若可能，输出 "YES"；否则输出 "NO"。

The first line contains a single integer $t$ ($1 \leq t \leq 6$) — the number of test cases.

The only line of each test case contains a single string consisting of each of the three characters $\texttt{a}$, $\texttt{b}$, and $\texttt{c}$ exactly once, representing the cards.

第一行包含一个整数 $t$（$1 \leq t \leq 6$）—— 表示测试用例的数量。

每个测试用例仅有一行，包含一个字符串，该字符串恰好由字符 $\texttt{a}$、$\texttt{b}$ 和 $\texttt{c}$ 各出现一次组成，表示三张卡片。

For each test case, output "YES" if you can make the row $\texttt{abc}$ with at most one operation, or "NO" otherwise.

You can output the answer in any case (for example, the strings "yEs", "yes", "Yes" and "YES" will be recognized as a positive answer).

对于每个测试用例，如果最多通过一次操作就能将行变为 $\texttt{abc}$，则输出 "YES"；否则输出 "NO"。

你可以以任意大小写形式输出答案（例如，字符串 "yEs"、"yes"、"Yes" 和 "YES" 均会被识别为肯定回答）。

In the first test case, we don't need to do any operations, since the row is already $\texttt{abc}$.

In the second test case, we can swap $\texttt{c}$ and $\texttt{b}$: $\texttt{acb} \to \texttt{abc}$.

In the third test case, we can swap $\texttt{b}$ and $\texttt{a}$: $\texttt{bac} \to \texttt{abc}$.

In the fourth test case, it is impossible to make $\texttt{abc}$ using at most one operation.

在第一个测试用例中，我们无需执行任何操作，因为该行已经是 $\texttt{abc}$。

在第二个测试用例中，我们可以交换 $\texttt{c}$ 和 $\texttt{b}$：$\texttt{acb} \to \texttt{abc}$。

在第三个测试用例中，我们可以交换 $\texttt{b}$ 和 $\texttt{a}$：$\texttt{bac} \to \texttt{abc}$。

在第四个测试用例中，无法通过至多一次操作得到 $\texttt{abc}$。