#include <bits/stdc++.h>
using namespace std;
const int N = 400 + 5;
char s[N], t[N];
int dp[N][N];
vector<char> a, b;
bool DP(int n, int m, int t) {
  for (int i = 0; i <= n; i++)
    for (int j = 0; j <= m; j++) dp[i][j] = -1;
  for (int i = 0; i <= n; i++) dp[i][0] = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j <= i && j < a.size(); j++) {
      if (dp[i - 1][j] != -1) {
        dp[i][j] = max(dp[i][j], dp[i - 1][j] + (s[i] == b[dp[i - 1][j] + 1]));
      }
      if (s[i] == a[j] && dp[i - 1][j - 1] != -1) {
        dp[i][j] = max(dp[i][j], dp[i - 1][j - 1]);
      }
    }
  }
  return dp[n][a.size() - 1] >= ((int)b.size() - 1);
}
int main() {
  int T;
  scanf("%d", &T);
  for (; T--;) {
    scanf("%s%s", s + 1, t + 1);
    int n = strlen(s + 1), m = strlen(t + 1);
    int cur = 1;
    for (int i = 1; i <= n; i++) {
      if (s[i] == t[cur]) cur++;
    }
    if (cur > m) {
      puts("YES");
      continue;
    }
    bool flag = 0;
    for (int i = 2; i <= m; i++) {
      a.clear();
      b.clear();
      a.push_back(0);
      b.push_back(0);
      for (int j = 1; j < i; j++) a.push_back(t[j]);
      for (int j = i; j <= m; j++) b.push_back(t[j]);
      if (DP(n, m, i)) {
        flag = 1;
        break;
      }
    }
    puts(flag ? "YES" : "NO");
  }
  return 0;
}
