#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > kandydaci[130];
bool czy[405][405];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) {
    string s1, s2;
    cin >> s1 >> s2;
    int sz2 = s2.size();
    bool yes = 0;
    for (int p = 0; p < (int)s2.size(); p++) {
      string a = "", b = "";
      for (int i = 0; i < p; i++) a += s2[i];
      for (int i = p; i < (int)s2.size(); i++) b += s2[i];
      if ((int)a.size() > 0) kandydaci[(int)a[0]].push_back({1, 0});
      if ((int)b.size() > 0) kandydaci[(int)b[0]].push_back({0, 1});
      for (int i = 1; i <= (int)s1.size() && yes == 0; i++) {
        int c = s1[i - 1];
        vector<pair<int, int> > toAdd[130];
        for (int j = 0; j < (int)kandydaci[c].size(); j++) {
          pair<int, int> x = kandydaci[c][j];
          if (x.first + x.second == sz2) {
            yes = 1;
            break;
          }
          if (x.first + 1 <= (int)a.size() && czy[x.first + 1][x.second] == 0) {
            toAdd[(int)a[x.first]].push_back({x.first + 1, x.second});
            czy[x.first + 1][x.second] = 1;
          }
          if (x.second + 1 <= (int)b.size() &&
              czy[x.first][x.second + 1] == 0) {
            toAdd[(int)b[x.second]].push_back({x.first, x.second + 1});
            czy[x.first][x.second + 1] = 1;
          }
        }
        kandydaci[c].clear();
        for (int j = 97; j <= 122; j++) {
          for (int k = 0; k < (int)toAdd[j].size(); k++) {
            pair<int, int> x = toAdd[j][k];
            kandydaci[j].push_back(x);
          }
        }
      }
      for (int i = 97; i <= 122; i++) kandydaci[i].clear();
      if (yes) break;
      for (int i = 0; i <= 400; i++)
        for (int j = 0; j <= 400; j++) czy[i][j] = 0;
    }
    if (yes)
      cout << "YES\n";
    else
      cout << "NO\n";
  }
  return 0;
}
