#include <bits/stdc++.h>
using namespace std;
void err() { cout << endl; }
template <class T, class... Ts>
void err(const T& arg, const Ts&... args) {
  cout << arg << ' ';
  err(args...);
}
using pII = pair<int, int>;
using ll = long long;
using db = double;
const int INF = 0x3f3f3f3f;
const ll INFLL = 0x3f3f3f3f3f3f3f3f;
const int N = 4e2 + 10;
int n, m;
char s[N], t[N];
int f[N][N];
bool gao(int mid) {
  int s1 = mid, s2 = m - mid;
  memset(f, -1, sizeof f);
  f[0][0] = 0;
  for (int i = 1; i <= n; ++i) {
    for (int j = s1; j >= 0; --j) {
      f[i][j] = max(f[i][j], f[i - 1][j]);
      if (f[i][j] == s2) continue;
      if (f[i][j] != -1 && s[i] == t[mid + f[i][j] + 1]) ++f[i][j];
      if (j && s[i] == t[j]) f[i][j] = max(f[i][j], f[i - 1][j - 1]);
    }
    if (f[i][s1] == s2) return true;
  }
  return false;
}
void RUN() {
  cin >> (s + 1);
  cin >> (t + 1);
  n = strlen(s + 1), m = strlen(t + 1);
  int pos = 1;
  for (int i = 1; i <= n && pos <= m; ++i) {
    if (s[i] == t[pos]) ++pos;
  }
  if (pos > m) {
    cout << "YES"
         << "\n";
    return;
  }
  for (int i = 1; i <= m; ++i) {
    if (gao(i)) {
      cout << "YES"
           << "\n";
      return;
    }
  }
  cout << "NO"
       << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr), cout.tie(nullptr);
  cout << fixed << setprecision(20);
  int T;
  cin >> T;
  while (T--) {
    RUN();
  }
  return 0;
}
