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 JAVA):

Solution:
/* package codechef; // don't place package name! */

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
import java.util.*; 
import java.lang.*; 
import java.io.*;
import java.math.BigInteger; 
import java.math.*;
   
public class Solution {
     public static ArrayList<Integer> primes(int n){
		boolean p[]= new boolean[n+1];
		for(int i=0;i<n;i++){
               p[i]=true;
		}p[0]=false;p[1]=false;
		for(int i=2;i*i<=n;i++){
			for(int j=i*i;j<=n;j+=i){
				if(p[j]==true){
					p[j]=false;
				}
			}
		}
		ArrayList<Integer> a= new ArrayList<>();
		for(int i=2;i<=n;i++){
			if(p[i]==true){
				a.add(i);
			}
		}
		return a;
	}
       static long lcm(long a ,long b){
      return  ((a*b)/(gcd(a,b))) ;
    }
    static long gcd(long a ,long b){
        if(b>a){
         return   gcd(b,a);
        }
        else{
            if (b == 0) {
        return a; }
    return gcd(b, a % b);  
        }
      
    }
      static BigInteger factorial(int x){
     	BigInteger result=new BigInteger("1");
    	while(x>0){
    		result=	result.multiply(BigInteger.valueOf(x));
    		x--;
    	}
    	return result;
    }
    static class Pair{
         private int x;
         private int y;
         Pair(int x,int y){
             this.x=x;
             this.y=y;
             
         }
         int getX(){
             return x;
         }
          int getY(){
             return y;
         }
          
     }
     static class N_comparator implements Comparator<Pair>{
	    @Override
	    public int compare (Pair o1, Pair o2){
	        return Integer.compare(o2.getX(),o1.getX());
	    }
	}
	static boolean isSub(String s1, String s2, int m, int n) 
    { 
        
        if (m == 0)  
           { return true; }
        if (n == 0)  
            {return false; }
        if (s1.charAt(m-1) == s2.charAt(n-1)) 
            {return isSub(s1, s2, m-1, n-1); }
  
        return isSub(s1, s2, m, n-1); 
    } 
	public static void main(String[] args) {
		
		InputStream inputStream = System.in;

		InputReader sc = new InputReader(inputStream);

				
		 int t=sc.nextInt();
		 while(t-->0){
		 //long c=1000000007;
	
	    String s=sc.next();String t2=sc.next();String p=sc.next();
	    boolean res=isSub( s,t2,s.length() ,t2.length());
	    if(res==false &&s.length()>0){
	        System.out.println("NO");
	    }else{
	    int s1[]= new int[26];
	    int t1[]= new int[26];
	    int p1[]= new int[26];
	    for(int i=0;i<s.length();i++){
	        s1[(int)s.charAt(i)-97]++;
	    }
	    for(int i=0;i<t2.length();i++){
	        t1[(int)t2.charAt(i)-97]++;
	    }
	    for(int i=0;i<p.length();i++){
	        p1[(int)p.charAt(i)-97]++;
	    }
	    int flag=0;
	    for(int i=0;i<26;i++){
	        if(s1[i]+p1[i]<t1[i]){
	            System.out.println("NO");flag=1;break;
	        }
	        
	        
	    }
	    if(flag==0){
	        
	     /*   for(int i=0;i<s.length();i++){
	            char temp=s.charAt(i);
	            
	            if(s.indexOf(temp,i)>t2.indexOf(temp)){
	            System.out.println("NO");flag=1;break;
	        }
	        }*/
	       // if(flag==0){
	        System.out.println("YES");
	            
	       // }
	    }
	  }  
		 }  
	}
	

	static class InputReader {
		public BufferedReader reader;
		public StringTokenizer tokenizer;

		public InputReader(InputStream stream) {
			reader = new BufferedReader(new InputStreamReader(stream), 32768);
			tokenizer = null;
		}

		public String next() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
				    tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
				    throw new RuntimeException(e);
				}
			}
			return tokenizer.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(next());
		}
		public long nextLong() {
			return Long.parseLong(next());
		}
	
		public double nextDouble() {
			return Double.parseDouble(next());
		}
		public float nextFloat() {
			return Float.parseFloat(next());
		}
		
		
	}
}