CF1223B.Strings Equalization

You are given two strings of equal length $s$ and $t$ consisting of lowercase Latin letters. You may perform any number (possibly, zero) operations on these strings.

During each operation you choose two adjacent characters in any string and assign the value of the first character to the value of the second or vice versa.

For example, if $s$ is "acbc" you can get the following strings in one operation:

• "aabc" (if you perform $s_2 = s_1$);
• "ccbc" (if you perform $s_1 = s_2$);
• "accc" (if you perform $s_3 = s_2$ or $s_3 = s_4$);
• "abbc" (if you perform $s_2 = s_3$);
• "acbb" (if you perform $s_4 = s_3$);

Note that you can also apply this operation to the string $t$.

Please determine whether it is possible to transform $s$ into $t$, applying the operation above any number of times.

Note that you have to answer $q$ independent queries.

给你两个长度相等的字符串 $s$ 和 $t$，均由小写拉丁字母组成。你可以对这两个字符串执行任意次数（可能为零次）的操作。

每次操作中，你可在任一字符串中选择两个相邻字符，并将前一个字符的值赋给后一个字符，或反之。

例如，若 $s$ 为 "acbc"，则一次操作后可得到以下字符串：

• "aabc"（若执行 $s_2 = s_1$）；
• "ccbc"（若执行 $s_1 = s_2$）；
• "accc"（若执行 $s_3 = s_2$ 或 $s_3 = s_4$）；
• "abbc"（若执行 $s_2 = s_3$）；
• "acbb"（若执行 $s_4 = s_3$）。

注意：你也可以对字符串 $t$ 执行该操作。

请判断是否可以通过若干次上述操作将 $s$ 变换为 $t$。

注意：你需要回答 $q$ 个相互独立的查询。

The first line contains one integer $q$ ($1 \le q \le 100$) — the number of queries. Each query is represented by two consecutive lines.

The first line of each query contains the string $s$ ($1 \le |s| \le 100$) consisting of lowercase Latin letters.

The second line of each query contains the string $t$ ($1 \le |t| \leq 100$, $|t| = |s|$) consisting of lowercase Latin letters.

第一行包含一个整数 $q$（$1 \le q \le 100$），表示查询次数。每次查询由连续的两行组成。

每次查询的第一行包含字符串 $s$（$1 \le |s| \le 100$），由小写拉丁字母组成。

每次查询的第二行包含字符串 $t$（$1 \le |t| \leq 100$，且 $|t| = |s|$），由小写拉丁字母组成。

For each query, print "YES" if it is possible to make $s$ equal to $t$, and "NO" otherwise.

You may print every letter in any case you want (so, for example, the strings "yEs", "yes", "Yes", and "YES" will all be recognized as positive answer).

对于每个查询，如果可以使 $s$ 等于 $t$，则输出 "YES"；否则输出 "NO"。

您可以以任意大小写形式输出每个字母（例如，字符串 "yEs"、"yes"、"Yes" 和 "YES" 均被视为肯定回答）。

In the first query, you can perform two operations $s_1 = s_2$ (after it $s$ turns into "aabb") and $t_4 = t_3$ (after it $t$ turns into "aabb").

In the second query, the strings are equal initially, so the answer is "YES".

In the third query, you can not make strings $s$ and $t$ equal. Therefore, the answer is "NO".

在第一次查询中，你可以执行两次操作：$s_1 = s_2$（操作后 $s$ 变为 "aabb"）和 $t_4 = t_3$（操作后 $t$ 变为 "aabb"）。

在第二次查询中，字符串初始即相等，因此答案为 "YES"。

在第三次查询中，你无法使字符串 $s$ 和 $t$ 相等。因此，答案为 "NO"。