From S To T
Contest: Educational Codeforces Round 68 (Rated for Div. 2)
Difficulty rating: 1300
Tags: implementation, strings

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.

Input format:
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.

Output format:
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).

Constraints:
Time limit: 1.0 s
Memory limit: 256.0 MB

Note:
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.

Example input:
4
ab
acxb
cax
a
aaaa
aaabbcc
a
aaaa
aabbcc
ab
baaa
aaaaa

Example output:
YES
YES
NO
NO

Editorial:
If the answer exists then each element of string $$$s$$$ matches with some element of string $$$t$$$. Thereby string $$$s$$$ must be a subsequence of string $$$t$$$.
Let $$$f(str, a)$$$ equal to the number of occurrences of the letter $$$a$$$ in the string $$$str$$$. Then for any letter $$$a$$$ condition $$$f(s, a) + f(p, a) \ge f(t, a)$$$ must be hold.
So the answer to the query is YES if following conditions hold:
1. string $$$s$$$ is subsequence of string $$$t$$$;
2. $$$f(s, a) + f(p, a) \ge f(t, a)$$$ for any Latin latter $$$a$$$.