#include <bits/stdc++.h>
using namespace std;
const int INF = 1E9;
vector<vector<int> > nxt, dp;
int main() {
  int T;
  cin >> T;
  while (T--) {
    string s, t, a = "", b = "";
    cin >> s >> t;
    int n = s.size(), m = t.size();
    nxt.assign(n + 1, vector<int>(26, INF));
    for (int i = n - 1; i >= 0; i--) {
      nxt[i] = nxt[i + 1];
      nxt[i][s[i] - 'a'] = i;
    }
    bool ok = false;
    for (int i = 0; i < m; i++) {
      a = t.substr(0, i), b = t.substr(i, m);
      int as = a.size(), bs = b.size();
      dp.assign(as + 1, vector<int>(bs + 1, INF));
      dp[0][0] = 0;
      for (int j = 0; j <= as; j++) {
        for (int k = 0; k <= bs; k++) {
          int len = dp[j][k];
          if (len > n) continue;
          if (j < as && nxt[len][a[j] - 'a'] < INF) {
            dp[j + 1][k] = min(dp[j + 1][k], nxt[len][a[j] - 'a'] + 1);
          }
          if (k < bs && nxt[len][b[k] - 'a'] < INF) {
            dp[j][k + 1] = min(dp[j][k + 1], nxt[len][b[k] - 'a'] + 1);
          }
        }
      }
      if (dp[as][bs] <= n) {
        ok = true;
        break;
      }
    }
    if (ok) {
      cout << "YES\n";
    } else {
      cout << "NO\n";
    }
  }
  return 0;
}
