#include <bits/stdc++.h>
using namespace std;
int n, m;
int dp[403][403][403];
string str, str1;
int solve(int i, int j, int k) {
  if (i == n) {
    if (k == m) {
      return (j);
    } else {
      return (-1);
    }
  }
  if (dp[i][j][k] != -2) {
    return (dp[i][j][k]);
  }
  int ans = -1;
  if (j < m && str1[j] == str[i]) {
    ans = max(ans, solve(i + 1, j + 1, k));
  }
  if (k < m && str1[k] == str[i]) {
    ans = max(ans, solve(i + 1, j, k + 1));
  }
  ans = max(ans, solve(i + 1, j, k));
  dp[i][j][k] = ans;
  return (ans);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int a, i, j, k, t;
  cin >> t;
  while (t--) {
    vector<int> arr(26, 0);
    cin >> str >> str1;
    n = str.size();
    m = str1.size();
    for (i = 0; i < n; i = i + 1) {
      arr[str[i] - 97]++;
    }
    for (i = 0; i < m; i = i + 1) {
      arr[str1[i] - 97]--;
    }
    a = 0;
    for (i = 0; i < 26; i = i + 1) {
      if (arr[i] < 0) {
        a = 1;
        break;
      }
    }
    if (a) {
      cout << "NO\n";
      continue;
    }
    for (i = 0; i <= n; i++) {
      for (j = 0; j <= m; j = j + 1) {
        for (k = 0; k <= m; k = k + 1) {
          dp[i][j][k] = -2;
        }
      }
    }
    a = 0;
    for (i = 0; i < m; i = i + 1) {
      if (solve(0, 0, i) >= i) {
        cout << "YES\n";
        a = 1;
        break;
      }
    }
    if (!a) {
      cout << "NO\n";
    }
  }
}
