Problem: 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 → ba, de → ade; 
  * aba → ba, de → dae; 
  * aba → ba, de → dea; 
  * aba → aa, de → bde; 
  * aba → aa, de → dbe; 
  * aba → aa, de → deb; 
  * aba → ab, de → ade; 
  * aba → ab, de → dae; 
  * aba → ab, de → 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 ≤ q ≤ 100) — the number of queries. Each query is represented by three consecutive lines.

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

The second line of each query contains the string t (1 ≤ |t| ≤ 100) consisting of lowercase Latin letters.

The third line of each query contains the string p (1 ≤ |p| ≤ 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: 

  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. 

Solution (in PYTHON3):

Solution:
def count_letters(s):
    res = dict()

    for c in s:
        if c in res:
            res[c] += 1
        else:
            res[c] = 1

    return res

def is_subsequence(s1, s2):
    if len(s1) == 0:
        return True
    if len(s2) == 0:
        return False

    if s1[-1] == s2[-1]:
        return is_subsequence(s1[:-1], s2[:-1])
    
    return is_subsequence(s1, s2[:-1])

if __name__ == "__main__":
    q = int(input())

    for _ in range(q):
        s = input()
        t = input()
        p = input()

        s_counts = count_letters(s)
        t_counts = count_letters(t)
        p_counts = count_letters(p)

        possible = True

        for x in t_counts:
            counts = 0
            if x in s_counts:
                counts += s_counts[x]
            if x in p_counts:
                counts += p_counts[x]
            if counts < t_counts[x]:
                possible = False
            
        if possible and is_subsequence(s, t):
            print("YES")
        else:
            print("NO")