#include <bits/stdc++.h>
using namespace std;
const long long INF = 0x3f3f3f3f;
const int maxn = 400 + 5;
const int mod = 1e9 + 7;
string s, t;
int dp[maxn][maxn];
int check(string &t1, string &t2) {
  memset((dp), (-1), sizeof(dp));
  dp[0][0] = 0;
  for (int i = 0; i < s.length(); i++) {
    for (int j = 0; j <= t1.size(); j++) {
      if (dp[i][j] >= 0) {
        int cur = dp[i][j];
        if (j < t1.size() && s[i] == t1[j])
          dp[i + 1][j + 1] = max(dp[i + 1][j + 1], cur);
        if (cur < t2.size() && s[i] == t2[cur])
          dp[i + 1][j] = max(dp[i + 1][j], cur + 1);
        dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);
      }
    }
  }
  return dp[s.size()][t1.size()] == t2.size();
}
void solve() {
  cin >> s >> t;
  int len = t.size();
  for (int i = 0; i < len; i++) {
    string t1 = t.substr(0, i);
    string t2 = t.substr(i);
    if (check(t1, t2)) {
      printf("YES\n");
      return;
    }
  }
  printf("NO\n");
}
int main(int argc, char *argv[]) {
  if (argc == 2 && strcmp("-debug", argv[1]) == 0) {
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
  }
  int t;
  scanf("%d", &t);
  while (t--) {
    solve();
  }
  return 0;
}
