#include <bits/stdc++.h>
using namespace std;
long long mkItll(string str) {
  long long val = 0, len = str.size();
  for (long long i = 0; i < len; i++) {
    val = val * 10 + str[i] - 48;
  }
  return val;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; }
bool isPrime(int n) {
  if (n == 1) return false;
  for (int i = 2; i * i <= n; i++) {
    if (n % i == 0) return false;
  }
  return true;
}
vector<long long> primes;
bool ar[1000005];
void sieve() {
  int maxN = 100005;
  ar[0] = ar[1] = true;
  for (long long i = 2; i * i <= maxN; i++) {
    if (!ar[i]) {
      for (long long j = i * i; j <= maxN; j += i) {
        ar[j] = true;
      }
    }
  }
  for (long long i = 2; i <= maxN; i++) {
    if (!ar[i]) {
      primes.push_back(i);
    }
  }
}
string allDigitAfterComma(int a, int b) {
  string ans = "";
  while (ans.size() != 500) {
    if (a < b) {
      a *= 10;
      while (a < b) {
        ans += '0';
        a *= 10;
      }
    } else {
      char ch = (a / b + '0');
      ans += ch;
      long long rem = a % b;
      if (rem == 0) {
        ans += '0';
        break;
      } else {
        a = rem;
      }
    }
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) {
    string s, t, p;
    cin >> s >> t >> p;
    map<int, int> mp;
    for (int i = 0; i < p.size(); i++) {
      mp[p[i] - 'a']++;
    }
    int l = 0, r = 0;
    bool f = 0;
    while (r != t.size()) {
      if (l < s.size() && s[l] == t[r]) {
        l++;
        r++;
        continue;
      } else {
        if (mp[t[r] - 'a']) {
          s.insert(l, 1, t[r]);
          mp[t[r] - 'a']--;
          l++;
          r++;
          continue;
        } else {
          f = 1;
          break;
        }
      }
    }
    if (s.size() > t.size()) f = 1;
    if (f)
      cout << "NO\n";
    else
      cout << "YES\n";
  }
  return 0;
}
