#include <bits/stdc++.h>
using namespace std;
int dp[404][404];
int lastt[1000];
int nextt[404][300];
bool check(string &s, string eka, string toka) {
  int n = s.size();
  int a = eka.size();
  int b = toka.size();
  for (int i = 0; i <= a; i++) {
    for (int j = 0; j <= b; j++) {
      if (i == 0 && j == 0) continue;
      if (i == 0) {
        int ind = dp[i][j - 1];
        if (nextt[ind][toka[j - 1]] == -1)
          dp[i][j] = n + 1;
        else
          dp[i][j] = nextt[ind][toka[j - 1]] + 1;
      } else if (j == 0) {
        int ind = dp[i - 1][j];
        if (nextt[ind][eka[i - 1]] == -1)
          dp[i][j] = n + 1;
        else
          dp[i][j] = nextt[ind][eka[i - 1]] + 1;
      } else {
        dp[i][j] = n + 1;
        int ind = dp[i][j - 1];
        if (nextt[ind][toka[j - 1]] != -1)
          dp[i][j] = min(dp[i][j], nextt[ind][toka[j - 1]] + 1);
        ind = dp[i - 1][j];
        if (nextt[ind][eka[i - 1]] != -1)
          dp[i][j] = min(dp[i][j], nextt[ind][eka[i - 1]] + 1);
      }
    }
  }
  return dp[a][b] <= n;
}
void testCase() {
  string s, t;
  cin >> s >> t;
  int n = s.size();
  for (int i = 'a'; i <= 'z'; i++) lastt[i] = -1;
  for (int i = n + 1; i >= 0; i--) {
    for (int j = 'a'; j <= 'z'; j++) {
      nextt[i][j] = -1;
    }
  }
  for (int i = n - 1; i >= 0; i--) {
    lastt[s[i]] = i;
    for (int j = 'a'; j <= 'z'; j++) {
      nextt[i][j] = lastt[j];
    }
  }
  n = t.size();
  for (int i = 0; i < n; i++) {
    if (check(s, t.substr(0, i + 1), t.substr(i + 1, n - (i + 1)))) {
      cout << "YES\n";
      return;
    }
  }
  cout << "NO\n";
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int t;
  cin >> t;
  for (int i = 0; i < t; i++) {
    testCase();
  }
}
