#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
bool solve(string s, string t) {
  int ind = 0;
  for (int i = 0; i < (int)(s).size(); ++i) {
    if (s[i] == t[ind]) {
      ++ind;
      if (ind == (int)(t).size()) return true;
    }
  }
  vector<vector<int> > dp((int)(s).size() + 1,
                          vector<int>((int)(s).size() + 1));
  for (int i = 1; i < (int)(t).size(); ++i) {
    string pref, suf;
    for (int j = 0; j < i; ++j) pref += t[j];
    for (int j = i; j < (int)(t).size(); ++j) suf += t[j];
    for (auto &x : dp)
      for (auto &j : x) j = -inf;
    dp[0][0] = 0;
    for (int j = 1; j <= (int)(s).size(); ++j) {
      for (int have = 0; have <= i; ++have) {
        dp[j][have] = max(dp[j - 1][have], dp[j][have]);
        if (dp[j - 1][have] < (int)(suf).size() && dp[j - 1][have] >= 0 &&
            suf[dp[j - 1][have]] == s[j - 1])
          dp[j][have] = max(dp[j][have], dp[j - 1][have] + 1);
        if (have < (int)(pref).size() && pref[have] == s[j - 1])
          dp[j][have + 1] = max(dp[j][have + 1], dp[j - 1][have]);
      }
    }
    if (dp[(int)(s).size()][(int)(pref).size()] == (int)(suf).size())
      return true;
  }
  return false;
}
signed main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int t;
  cin >> t;
  while (t--) {
    string s, t;
    cin >> s >> t;
    if (solve(s, t))
      cout << "YES\n";
    else
      cout << "NO\n";
  }
  return 0;
}
