Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

C. From S To T

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou 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

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

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).

Example

Input

4 ab acxb cax a aaaa aaabbcc a aaaa aabbcc ab baaa aaaaa

Output

YES YES NO NO

Note

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

- $$$s = $$$ ab, $$$t = $$$ acxb, $$$p = $$$ cax;
- $$$s = $$$ acb, $$$t = $$$ acxb, $$$p = $$$ ax;
- $$$s = $$$ acxb, $$$t = $$$ acxb, $$$p = $$$ a.

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

- $$$s = $$$ a, $$$t = $$$ aaaa, $$$p = $$$ aaabbcc;
- $$$s = $$$ aa, $$$t = $$$ aaaa, $$$p = $$$ aabbcc;
- $$$s = $$$ aaa, $$$t = $$$ aaaa, $$$p = $$$ abbcc;
- $$$s = $$$ aaaa, $$$t = $$$ aaaa, $$$p = $$$ bbcc.

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Aug/23/2019 20:24:30 (h2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|