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. 
import java.io.*;
import java.util.*;
import java.math.*;
public class work
{
    static FastReader s;;
    static int dp[];
    static PrintWriter out;
    static class pair
    {
        int a,b;
        pair(int x, int y)
        {
            a=x;
            b=y;
        }
    }
    public static void main(String[] args) throws IOException
    {
        
        s = new FastReader();
        out=new PrintWriter(System.out);
        int xx = s.ni();
        while(xx-->0)
        {
            String st = s.next();
            String t = s.next();
            String p = s.next();
            if (!isSubSequence(st, t, st.length(), t.length()))
                println("NO");
            else
            {
                int freq[] = new int[26];
                int freq2[] = new int[26];
                
                for (int i = 0; i < st.length(); i++)
                    freq[st.charAt(i)-'a']++;
                for (int i = 0; i < p.length(); i++)
                    freq[p.charAt(i)-'a']++;
                for (int i = 0; i < t.length(); i++)
                    freq2[t.charAt(i)-'a']++;
                int flag = 0;
                for (int i = 0; i < 26; i++)
                {
                    if (freq[i] < freq2[i])
                    {
                        flag = 1;
                        break;
                    }
                }
                if (flag == 1)
                    println("NO");
                else
                    println("YES");
            }

            out.flush();
            
        }
        out.close();
    }  

    static boolean isSubSequence(String str1,  
                    String str2, int m, int n) 
    { 
        int j = 0; 
          
        // Traverse str2 and str1, and compare  
        // current character of str2 with first 
        // unmatched char of str1, if matched  
        // then move ahead in str1 
        for (int i = 0; i < n && j < m; i++) 
            if (str1.charAt(j) == str2.charAt(i)) 
                j++; 
  
        // If all characters of str1 were found 
        // in str2 
        return (j == m);  
    } 

    /*static int gcd(int a, int b) 
    { 
      if (b == 0) 
        return a; 
      return gcd(b, a % b);  
    }

    static long lgcd(long a, long b) 
    { 
      if (b == 0) 
        return a; 
      return lgcd(b, a % b);  
    }*/

    

    static class FastReader
    {

        BufferedReader br;
        StringTokenizer st;

        public FastReader()
        {
            br = new BufferedReader(new InputStreamReader(System.in));
        }
        public FastReader(String file_name) throws IOException
        {
            br = new BufferedReader(new FileReader(file_name));
        }
        String next()
        {
            while (st == null || !st.hasMoreElements())
            {
                try
                {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e)
                {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int ni()
        {
            return Integer.parseInt(next());
        }

        long nl()
        {
            return Long.parseLong(next());
        }

        double nextDouble()
        {
            return Double.parseDouble(next());
        }

        String nextLine()
        {
            String str = "";
            try
            {
                str = br.readLine();
            } catch (IOException e)
            {
                e.printStackTrace();
            }
            return str;
        }
        
    }

    static void piarr(int arr[])
    {
        int n = arr.length;
        for (int i = 0; i < n; i++)
        {
            print(arr[i]+" ");
        }
        println("");
    }

    static void plarr(long arr[])
    {
        int n = arr.length;
        for (int i = 0; i < n; i++)
        {
            print(arr[i]+" ");
        }
        println("");
    }

    static void println(Object line) 
    {
        out.println(line);
    }
    static void print(Object line) 
    {
        out.print(line);
    }
    static Integer[] iarr(int n)
    {
        Integer arr[]=new Integer[n];
        for(int i = 0; i < n;i++)
            arr[i]=s.ni();
        return arr;
    }

    static Long[] larr(int n)
    {
        Long arr[]=new Long[n];
        for(int i = 0; i < n;i++)
            arr[i]=s.nl();
        return arr;
    }

    static Integer[][] i2arr(int n, int m)
    {
        Integer arr[][]=new Integer[n][m];
        for(int i = 0; i < n;i++)
            for(int j = 0; j < m;j++)
                arr[i][j]=s.ni();
        return arr;
    }

    static Long[][] l2arr(int n, int m)
    {
        Long arr[][]=new Long[n][m];
        for(int i = 0; i < n;i++)
            for(int j = 0; j < m;j++)
                arr[i][j]=s.nl();
        return arr;
    }

    static char [] nc()
    {
        String str = s.next();
        char c[] = str.toCharArray();
        return c;
    }
    static char [][] n2c(int n)
    {
        char c[][] = new char[n][];
        for (int i = 0; i < n; i++)
            c[i] = s.next().toCharArray();
        return c;
    }

}