CF1672B.I love AAAB

Let's call a string good if its length is at least $2$ and all of its characters are $\texttt{A}$ except for the last character which is $\texttt{B}$. The good strings are $\texttt{AB},\texttt{AAB},\texttt{AAAB},\ldots$. Note that $\texttt{B}$ is not a good string.

You are given an initially empty string $s_1$.

You can perform the following operation any number of times:

• Choose any position of $s_1$ and insert some good string in that position.

Given a string $s_2$, can we turn $s_1$ into $s_2$ after some number of operations?

我们称一个字符串是“好”的，当且仅当其长度至少为 $2$，且除最后一个字符为 $\texttt{B}$ 外，其余所有字符均为 $\texttt{A}$。因此，所有“好”字符串形如 $\texttt{AB},\texttt{AAB},\texttt{AAAB},\ldots$。注意：$\texttt{B}$ 本身不是“好”字符串。

给定一个初始为空的字符串 $s_1$。

你可以执行以下操作任意多次：

• 任选 $s_1$ 中的一个位置，并在该位置插入某个“好”字符串。

给定一个字符串 $s_2$，能否通过若干次上述操作将 $s_1$ 变为 $s_2$？

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

The first line of each test case contains a single string $s_2$ ($1 \leq |s_2| \leq 2 \cdot 10^5$).

It is guaranteed that $s_2$ consists of only the characters $\texttt{A}$ and $\texttt{B}$.

It is guaranteed that the sum of $|s_2|$ over all test cases does not exceed $2 \cdot 10^5$.

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

每个测试用例的第一行包含一个字符串 $s_2$（$1 \leq |s_2| \leq 2 \cdot 10^5$）。

保证 $s_2$ 仅由字符 $\texttt{A}$ 和 $\texttt{B}$ 组成。

保证所有测试用例的 $|s_2|$ 之和不超过 $2 \cdot 10^5$。

For each test case, print "YES" (without quotes) if we can turn $s_1$ into $s_2$ after some number of operations, and "NO" (without quotes) otherwise.

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

对于每个测试用例，如果经过若干次操作后可以将 $s_1$ 变为 $s_2$，则输出 "YES"（不带引号）；否则输出 "NO"（不带引号）。

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

In the first test case, we transform $s_1$ as such: $\varnothing \to \color{red}{\texttt{AAB}} \to \texttt{A}\color{red}{\texttt{AB}}\texttt{AB}$.

In the third test case, we transform $s_1$ as such: $\varnothing \to \color{red}{\texttt{AAAAAAAAB}}$.

In the second and fourth test case, it can be shown that it is impossible to turn $s_1$ into $s_2$.

在第一个测试用例中，我们对 $s_1$ 进行如下变换：$\varnothing \to \color{red}{\texttt{AAB}} \to \texttt{A}\color{red}{\texttt{AB}}\texttt{AB}$。

在第三个测试用例中，我们对 $s_1$ 进行如下变换：$\varnothing \to \color{red}{\texttt{AAAAAAAAB}}$。

在第二个和第四个测试用例中，可以证明无法将 $s_1$ 变为 $s_2$。