CF1650A.Deletions of Two Adjacent Letters

The string $s$ is given, the string length is odd number. The string consists of lowercase letters of the Latin alphabet.

As long as the string length is greater than $1$, the following operation can be performed on it: select any two adjacent letters in the string $s$ and delete them from the string. For example, from the string "lemma" in one operation, you can get any of the four strings: "mma", "lma", "lea" or "lem" In particular, in one operation, the length of the string reduces by $2$.

Formally, let the string $s$ have the form $s=s_1s_2 \dots s_n$ ($n \gt 1$). During one operation, you choose an arbitrary index $i$ ($1 \le i \lt n$) and replace $s=s_1s_2 \dots s_{i-1}s_{i+2} \dots s_n$.

For the given string $s$ and the letter $c$, determine whether it is possible to make such a sequence of operations that in the end the equality $s=c$ will be true? In other words, is there such a sequence of operations that the process will end with a string of length $1$, which consists of the letter $c$?

给定字符串 $s$，其长度为奇数。字符串 $s$ 仅由拉丁字母表中的小写字母组成。

只要字符串长度大于 $1$，就可以对其执行如下操作：在字符串 $s$ 中任选两个相邻的字母，并将它们从字符串中删除。例如，对字符串 “lemma” 执行一次操作，可得到以下四个字符串之一：“mma”、“lma”、“lea” 或 “lem”。特别地，每次操作会使字符串长度减少 $2$。

形式化地，设字符串 $s$ 的形式为 $s=s_1s_2 \dots s_n$（其中 $n \gt 1$）。在一次操作中，任选一个下标 $i$（满足 $1 \le i \lt n$），并将 $s$ 替换为 $s_1s_2 \dots s_{i-1}s_{i+2} \dots s_n$。

对于给定的字符串 $s$ 和字母 $c$，判断是否存在一系列上述操作，使得最终得到的字符串恰好为 $s=c$？换言之，是否存在一系列操作，使得该过程最终终止于一个长度为 $1$ 的字符串，且该字符串仅由字母 $c$ 构成？

The first line of input data contains an integer $t$ ($1 \le t \le 10^3$) — the number of input test cases.

The descriptions of the $t$ cases follow. Each test case is represented by two lines:

• string $s$, which has an odd length from $1$ to $49$ inclusive and consists of lowercase letters of the Latin alphabet;
• is a string containing one letter $c$, where $c$ is a lowercase letter of the Latin alphabet.

输入数据的第一行包含一个整数 $t$（$1 \le t \le 10^3$）—— 表示输入测试用例的数量。

接下来是 $t$ 个测试用例的描述。每个测试用例由两行组成：

• 字符串 $s$，其长度为奇数，取值范围为 $1$ 到 $49$（含端点），且仅由小写拉丁字母组成；
• 一个仅包含单个字母 $c$ 的字符串，其中 $c$ 为小写拉丁字母。

For each test case in a separate line output:

• YES, if the string $s$ can be converted so that $s=c$ is true;
• NO otherwise.

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

对于每个测试用例，在单独的一行中输出：

• 如果字符串 $s$ 可以被转换为使得 $s=c$ 成立，则输出 YES；
• 否则输出 NO。

YES 和 NO 的大小写不限（例如，字符串 yEs、yes、Yes 和 YES 均被视为肯定回答）。

In the first test case, $s$="abcde". You need to get $s$="c". For the first operation, delete the first two letters, we get $s$="cde". In the second operation, we delete the last two letters, so we get the expected value of $s$="c".

In the third test case, $s$="x", it is required to get $s$="y". Obviously, this cannot be done.

在第一个测试用例中，$s$ = "abcde"，你需要得到 $s$ = "c"。第一次操作中，删除前两个字母，得到 $s$ = "cde"；第二次操作中，删除最后两个字母，从而得到期望的 $s$ = "c"。

在第三个测试用例中，$s$ = "x"，要求得到 $s$ = "y"。显然，这是不可能的。