#include <bits/stdc++.h>
using namespace std;
const int ALP = 26;
const int INF = 1e5 + 239;
void solve() {
  string s, t;
  cin >> s >> t;
  vector<vector<int>> nx(ALP, vector<int>(s.size() + 1));
  for (int c = 0; c < ALP; c++) {
    nx[c][(int)s.size()] = INF;
    for (int i = (int)s.size() - 1; i >= 0; i--) {
      if (s[i] == (c + 'a'))
        nx[c][i] = i;
      else
        nx[c][i] = nx[c][i + 1];
    }
  }
  auto apply = [&](string x, string y) {
    vector<vector<int>> dp((int)x.size() + 1, vector<int>(y.size() + 1, INF));
    dp[0][0] = 0;
    for (int i = 0; i <= (int)x.size(); i++) {
      for (int j = 0; j <= (int)y.size(); j++) {
        if (dp[i][j] > (int)s.size()) continue;
        if (i + 1 <= (int)x.size()) {
          int to = nx[x[i] - 'a'][dp[i][j]];
          dp[i + 1][j] = min(dp[i + 1][j], to + 1);
        }
        if (j + 1 <= (int)y.size()) {
          int to = nx[y[j] - 'a'][dp[i][j]];
          dp[i][j + 1] = min(dp[i][j + 1], to + 1);
        }
      }
    }
    return dp[(int)x.size()][(int)y.size()] <= (int)s.size();
  };
  for (int lp = 0; lp < (int)t.size(); lp++) {
    string a = t.substr(0, lp);
    string b = t.substr(lp, (int)t.size() - lp);
    if (apply(a, b)) {
      cout << "YES\n";
      return;
    }
  }
  cout << "NO\n";
  return;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int q;
  cin >> q;
  while (q--) solve();
}
