#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e9 + 7;
const long long INF = 1LL << 60;
const long long mod = 1e9 + 7;
const long double eps = 1e-8;
const long double pi = acos(-1.0);
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
vector<vector<long long>> calcnext(string s) {
  long long n = (long long)s.size();
  vector<vector<long long>> res(n + 1, vector<long long>(26, n));
  for (long long i = n - 1; i >= 0; --i) {
    for (long long j = 0; j < 26; j++) {
      res[i][j] = res[i + 1][j];
    }
    res[i][s[i] - 'a'] = i;
  }
  return res;
}
void solve() {
  string s, t;
  cin >> s >> t;
  long long n = (long long)s.size(), m = (long long)t.size();
  vector<vector<long long>> next = calcnext(s);
  for (long long i = 0; i < m; ++i) {
    string tb = t.substr(0, i), tf = t.substr(i);
    vector<vector<long long>> dp(n + 3, vector<long long>(n + 3, INF));
    dp[0][0] = 0;
    for (long long j = 0; j < (long long)tb.size() + 1; j++) {
      for (long long k = 0; k < (long long)tf.size() + 1; k++) {
        long long bdp = dp[j][k];
        if (bdp >= n) continue;
        if (j < (long long)tb.size() && next[bdp][tb[j] - 'a'] != n) {
          chmin(dp[j + 1][k], next[bdp][tb[j] - 'a'] + 1);
        }
        if (k < (long long)tf.size() && next[bdp][tf[k] - 'a'] != n) {
          chmin(dp[j][k + 1], next[bdp][tf[k] - 'a'] + 1);
        }
      }
    }
    if (dp[(long long)tb.size()][(long long)tf.size()] <= n) {
      cout << "YES" << endl;
      return;
    }
  }
  cout << "NO" << endl;
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long t;
  cin >> t;
  for (long long i = 0; i < t; i++) solve();
  return 0;
}
