#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
template <class T>
inline bool setmin(T &a, T b) {
  if (a > b) return a = b, 1;
  return 0;
}
template <class T>
inline bool setmax(T &a, T b) {
  if (a < b) return a = b, 1;
  return 0;
}
template <class T>
inline T fast(T a, T b, T mod) {
  long long res = 1;
  while (b) {
    if (b & 1) res = (res * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return res;
}
template <class T>
inline T russian(T a, T b, T mod) {
  long long res = 0;
  while (b) {
    if (b & 1) res = (res + a) % mod;
    a = (a + a) % mod;
    b >>= 1;
  }
  return res;
}
template <class T>
inline T sub(T a, T b, T mod) {
  return ((a % mod - b % mod) + mod) % mod;
}
template <class T>
istream &operator>>(istream &os, vector<T> &container) {
  for (auto &u : container) os >> u;
  return os;
}
template <class T>
ostream &operator<<(ostream &os, const vector<T> &container) {
  for (auto &u : container) os << u << " ";
  return os;
}
template <typename T>
inline T gcd(T a, T b) {
  while (b) swap(a %= b, b);
  return a;
}
long double e = 2.7182818284590452353602874713526624;
long double PI = acos(-1);
long double eps = 1e-11;
const long long T = 1 << 19;
const long long INF = 1e9 + 7;
const long long MOD = 998244353;
const long long BIG_INF = 1e18 + 7;
const long long N = 1e6 + 7;
const long long M = 2007;
long long n, m, k;
int dp[106][106];
int A[30];
int B[30];
int lca(string a, string b) {
  for (int i = 0; i < (int)(a).size(); i++) {
    for (int j = 0; j < (int)(b).size(); j++) {
      if (a[i] == b[j]) {
        dp[i + 1][j + 1] = dp[i][j] + 1;
      } else {
        dp[i + 1][j + 1] = max(dp[i + 1][j], dp[i][j + 1]);
      }
    }
  }
  return dp[(int)(a).size()][(int)(b).size()];
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int testy;
  cin >> testy;
  while (testy--) {
    string second, t, p;
    cin >> second >> t >> p;
    if (lca(second, t) == (int)(second).size()) {
      for (int i = 0; i < 26; i++) {
        A[i] = 0;
        B[i] = 0;
      }
      for (auto &u : second) {
        A[u - 'a']++;
      }
      for (auto &u : p) {
        A[u - 'a']++;
      }
      for (auto &u : t) {
        B[u - 'a']++;
      }
      bool good = 1;
      for (int i = 0; i < 26; i++) {
        if (B[i] > A[i]) good = 0;
      }
      if (good) {
        cout << "YES\n";
        continue;
      }
    }
    cout << "NO\n";
  }
}
