#include <bits/stdc++.h>
using namespace std;
const int maxn = 400 + 7;
int dp[maxn][maxn], lens, lent, fla;
char s[maxn], t[maxn];
int sol(int a, int b, int c, int d) {
  int len1 = b - a + 1;
  int len2 = d - c + 1;
  dp[0][0] = 0;
  for (int i = 1; i <= len1; i++) dp[0][i] = -1;
  for (int i = 1; i <= lens; i++) {
    dp[i][0] = dp[i - 1][0];
    if (s[i] == t[c - 1 + dp[i - 1][0] + 1]) dp[i][0]++;
    for (int j = 1; j <= len1; j++) {
      dp[i][j] = dp[i - 1][j];
      if (s[i] == t[a - 1 + j] && dp[i - 1][j - 1] != -1)
        dp[i][j] = max(dp[i][j], dp[i - 1][j - 1]);
      if (dp[i - 1][j] != -1 && s[i] == t[c - 1 + dp[i - 1][j] + 1])
        dp[i][j] = max(dp[i][j], dp[i - 1][j] + 1);
    }
  }
  if (dp[lens][len1] == len2) {
    return 1;
  } else
    return 0;
}
int main() {
  int T;
  scanf("%d", &T);
  while (T--) {
    fla = 0;
    scanf("%s", s + 1);
    scanf("%s", t + 1);
    lens = strlen(s + 1);
    lent = strlen(t + 1);
    int cnt = 0;
    for (int i = 1; i <= lens; i++)
      if (cnt + 1 <= lent && t[cnt + 1] == s[i]) cnt++;
    if (cnt == lent) {
      printf("YES\n");
      continue;
    }
    for (int i = 1; i < lent; i++) fla += sol(1, i, i + 1, lent);
    if (fla)
      printf("YES\n");
    else
      printf("NO\n");
  }
  return 0;
}
