#include <bits/stdc++.h>
using namespace std;
int f[410][410], n, m, l;
char s[410], a[410], b[410], t[410];
int nex[410][30];
int solve() {
  int i, j, k;
  for (i = 0; i <= n; i++)
    for (j = 0; j <= m; j++) f[i][j] = l + 1;
  f[0][0] = 0;
  for (i = 0; i <= n; i++) {
    for (j = 0; j <= m; j++) {
      if (i != 0 && f[i - 1][j] != l + 1)
        f[i][j] = min(f[i][j], nex[f[i - 1][j]][a[i] - 'a']);
      if (j != 0 && f[i][j - 1] != l + 1)
        f[i][j] = min(f[i][j], nex[f[i][j - 1]][b[j] - 'a']);
    }
  }
  return f[n][m] != l + 1;
}
int main() {
  int i, T, j;
  scanf("%d", &T);
  while (T--) {
    scanf("%s%s", s + 1, t + 1);
    l = strlen(s + 1);
    memset(nex, 0, sizeof(nex));
    for (i = l; i >= 0; i--) {
      if (l == i)
        for (j = 0; j < 26; j++) nex[i][j] = l + 1;
      else {
        for (j = 0; j < 26; j++) nex[i][j] = nex[i + 1][j];
        nex[i][s[i + 1] - 'a'] = i + 1;
      }
    }
    int ans = 0;
    for (i = 1; t[i]; i++) {
      n = m = 0;
      for (j = 1; j <= i; j++) a[++n] = t[j];
      for (j = i + 1; t[j]; j++) b[++m] = t[j];
      if (solve()) {
        ans = 1;
        break;
      }
    }
    if (ans)
      printf("YES\n");
    else
      printf("NO\n");
  }
}
