CF1278A.Shuffle Hashing

Polycarp has built his own web service. Being a modern web service it includes login feature. And that always implies password security problems.

Polycarp decided to store the hash of the password, generated by the following algorithm:

1. take the password $p$, consisting of lowercase Latin letters, and shuffle the letters randomly in it to obtain $p'$ ($p'$ can still be equal to $p$);
2. generate two random strings, consisting of lowercase Latin letters, $s_1$ and $s_2$ (any of these strings can be empty);
3. the resulting hash $h = s_1 + p' + s_2$, where addition is string concatenation.

For example, let the password $p =$ "abacaba". Then $p'$ can be equal to "aabcaab". Random strings $s1 =$ "zyx" and $s2 =$ "kjh". Then $h =$ "zyxaabcaabkjh".

Note that no letters could be deleted or added to $p$ to obtain $p'$, only the order could be changed.

Now Polycarp asks you to help him to implement the password check module. Given the password $p$ and the hash $h$, check that $h$ can be the hash for the password $p$.

Your program should answer $t$ independent test cases.

Polycarp 开发了自己的网络服务。作为一个现代化的网络服务，它包含了登录功能，而登录功能必然涉及密码安全问题。

Polycarp 决定存储密码的哈希值，该哈希值通过以下算法生成：

1. 取由小写拉丁字母组成的密码 $p$，将其字母随机打乱得到 $p'$（$p'$ 有可能与 $p$ 相同）；
2. 随机生成两个仅由小写拉丁字母组成的字符串 $s_1$ 和 $s_2$（这两个字符串均可为空）；
3. 最终得到的哈希值为 $h = s_1 + p' + s_2$，其中 “+” 表示字符串拼接。

例如，设密码 $p =$ "abacaba"，则 $p'$ 可以是 "aabcaab"；随机字符串 $s_1 =$ "zyx"，$s_2 =$ "kjh"，那么 $h =$ "zyxaabcaabkjh"。

注意：为得到 $p'$，不能从 $p$ 中删除或添加任何字母，只能改变字母的顺序。

现在 Polycarp 请求你帮助他实现密码校验模块：给定密码 $p$ 和哈希值 $h$，判断 $h$ 是否可能是密码 $p$ 对应的哈希值。

你的程序需要处理 $t$ 个相互独立的测试用例。

The first line contains one integer $t$ ($1 \le t \le 100$) — the number of test cases.

The first line of each test case contains a non-empty string $p$, consisting of lowercase Latin letters. The length of $p$ does not exceed $100$.

The second line of each test case contains a non-empty string $h$, consisting of lowercase Latin letters. The length of $h$ does not exceed $100$.

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

每个测试用例的第一行包含一个非空字符串 $p$，由小写拉丁字母组成。$p$ 的长度不超过 $100$。

每个测试用例的第二行包含一个非空字符串 $h$，由小写拉丁字母组成。$h$ 的长度不超过 $100$。

For each test case print the answer to it — "YES" if the given hash $h$ could be obtained from the given password $p$ or "NO" otherwise.

对于每个测试用例，输出对应的答案——如果给定的哈希值 $h$ 可能由给定的密码 $p$ 生成，则输出 "YES"；否则输出 "NO"。

The first test case is explained in the statement.

In the second test case both $s_1$ and $s_2$ are empty and $p'=$ "threetwoone" is $p$ shuffled.

In the third test case the hash could not be obtained from the password.

In the fourth test case $s_1=$ "n", $s_2$ is empty and $p'=$ "one" is $p$ shuffled (even thought it stayed the same).

In the fifth test case the hash could not be obtained from the password.

第一个测试用例在题目描述中已作解释。

第二个测试用例中，$s_1$ 和 $s_2$ 均为空，且 $p'=$ "threetwoone" 是 $p$ 的一个打乱排列。

第三个测试用例中，该哈希值无法由密码得到。

第四个测试用例中，$s_1=$ "n"，$s_2$ 为空，且 $p'=$ "one" 是 $p$ 的一个打乱排列（即使它本身未发生变化）。

第五个测试用例中，该哈希值无法由密码得到。