CF1194C.From S To T

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

During each operation you choose any character from $p$, erase it from $p$ and insert it into string $s$ (you may insert this character anywhere you want: in the beginning of $s$, in the end or between any two consecutive characters).

For example, if $p$ is aba, and $s$ is de, then the following outcomes are possible (the character we erase from $p$ and insert into $s$ is highlighted):

• aba $\rightarrow$ ba, de $\rightarrow$ ade;
• aba $\rightarrow$ ba, de $\rightarrow$ dae;
• aba $\rightarrow$ ba, de $\rightarrow$ dea;
• aba $\rightarrow$ aa, de $\rightarrow$ bde;
• aba $\rightarrow$ aa, de $\rightarrow$ dbe;
• aba $\rightarrow$ aa, de $\rightarrow$ deb;
• aba $\rightarrow$ ab, de $\rightarrow$ ade;
• aba $\rightarrow$ ab, de $\rightarrow$ dae;
• aba $\rightarrow$ ab, de $\rightarrow$ dea;

Your goal is to perform several (maybe zero) operations so that $s$ becomes equal to $t$. Please determine whether it is possible.

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

给你三个由小写拉丁字母组成的字符串 $s$、$t$ 和 $p$。你可以对这些字符串执行任意次数（可能为零）的操作。

在每次操作中，你需从 $p$ 中任选一个字符，将其从 $p$ 中删除，并插入到字符串 $s$ 中（你可以将该字符插入到 $s$ 的任意位置：开头、结尾，或任意两个相邻字符之间）。

例如，若 $p$ 为 aba，$s$ 为 de，则以下结果均是可能的（被从 $p$ 中删除并插入到 $s$ 中的字符已高亮显示）：

• aba $\rightarrow$ ba, de $\rightarrow$ ade;
• aba $\rightarrow$ ba, de $\rightarrow$ dae;
• aba $\rightarrow$ ba, de $\rightarrow$ dea;
• aba $\rightarrow$ aa, de $\rightarrow$ bde;
• aba $\rightarrow$ aa, de $\rightarrow$ dbe;
• aba $\rightarrow$ aa, de $\rightarrow$ deb;
• aba $\rightarrow$ ab, de $\rightarrow$ ade;
• aba $\rightarrow$ ab, de $\rightarrow$ dae;
• aba $\rightarrow$ ab, de $\rightarrow$ dea;

你的目标是执行若干次（可能为零次）操作，使得 $s$ 变为与 $t$ 相等。请判断是否可行。

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

The first line contains one integer $q$ ($1 \le q \le 100$) — the number of queries. Each query is represented by three 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| \le 100$) consisting of lowercase Latin letters.

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

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

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

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

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

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 test case there is the following sequence of operation:

1. $s = $ ab, $t = $ acxb, $p = $ cax;
2. $s = $ acb, $t = $ acxb, $p = $ ax;
3. $s = $ acxb, $t = $ acxb, $p = $ a.

In the second test case there is the following sequence of operation:

1. $s = $ a, $t = $ aaaa, $p = $ aaabbcc;
2. $s = $ aa, $t = $ aaaa, $p = $ aabbcc;
3. $s = $ aaa, $t = $ aaaa, $p = $ abbcc;
4. $s = $ aaaa, $t = $ aaaa, $p = $ bbcc.

在第一个测试用例中，操作序列为：

1. $s = $ ab，$t = $ acxb，$p = $ cax；
2. $s = $ acb，$t = $ acxb，$p = $ ax；
3. $s = $ acxb，$t = $ acxb，$p = $ a。

在第二个测试用例中，操作序列为：

1. $s = $ a，$t = $ aaaa，$p = $ aaabbcc；
2. $s = $ aa，$t = $ aaaa，$p = $ aabbcc；
3. $s = $ aaa，$t = $ aaaa，$p = $ abbcc；
4. $s = $ aaaa，$t = $ aaaa，$p = $ bbcc。