/*Rofyda Mohamed Hamed Hamed Elghadban*/
 //#include <bits/stdc++.h>
 #include <iostream>
 #include <iomanip>
 #include <cmath>
 #include <algorithm>
 #include <cstdlib>
 #include <limits.h>
 #include <string>
 #include <vector>
 #include <map>
 #include <stack>
 #include <set>
 #include <deque>
 #include <fstream>
 #include <bitset>
 #include <cmath>
 #include <numeric>
 #include <cstring>
 #include <utility>
 #include <queue>

 /***********************************************************************************/

 #define ll long long
 #define ull unsigned long long
 #define pi 3.141592654
 #define NUM 1e18
 #define Mod  1'000'000'007
 #define fixed(n) fixed<<setprecision(n)
 #define cin(v) for(auto &i:v) cin >> i ;
 #define cout(v) for(auto &i:v) cout << i  <<" ";
 #define vowel(x) (x=='e'||x=='a'||x=='i'||x=='o'||x=='u')
 #define small(x) (x>=97&&x<=122)
 #define capital(x) (x>=65&&x<=90)
 #define Tolower(s) transform(s.begin(),s.end(),s.begin(),::tolower);
 #define Toupper(s) transform(s.begin(),s.end(),s.begin(),::toupper);
 #define all(v) ((v).begin()), ((v).end())
 #define allr(v) ((v).rbegin()), ((v).rend())
 #define updmax(a,b) a=max(a,b)
 #define updmin(a,b) a=min(a,b)
 #define ceil(a,b) ((a/b)+(a%b?1:0))
 /* asc -> 1 2 3 ,des -> 3 2 1 */

 /***********************************************************************************/

 using namespace std;

 void Rofyda_Elghadban(){
  #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
   #endif
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
 }

 void solve(){
 }

 ll prefix[10000001]{},mini=LLONG_MAX;

 int main(){
  Rofyda_Elghadban();
 //freopen("input.txt","r",stdin);
 //freopen("output.txt","r",stdout);
 //solve();

 int t;
 cin>>t;
 while(t--){
  string s,t,p;
  cin>>s>>t>>p;
  int freq[123]{},counter=0,idx=0;
  for(int i=0;i<p.size();i++){
    freq[p[i]]++;
  }
  for(int i=0;i<t.size();i++){
    if(t[i]==s[idx]){
      idx++;
      counter++;
    }else if(t[i]!=s[idx]){
      if(freq[t[i]]>0){
        freq[t[i]]--;
        counter++;
      }
    }
  }
  if(idx==s.size()&&counter==t.size()){
    cout<<"YES"<<"\n";
  }else{
    cout<<"NO"<<"\n";
  }
 }



 return 0;
}