#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")
using namespace std;

void solve(int cs) {
  string a, b;
  cin >> a >> b;
  int n = a.size(), m = b.size();
  for (int i = 0, j = 0; i < n; i++) {
    if (a[i] == b[j]) {
      j += 1;
      if (j == m) {
        cout << "YES\n";
        return;
      }
    }
  }
  cout << "NO\n";
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int tc = 1;
  cin >> tc;
  for (int cs = 1; cs <= tc; cs++) {
    solve(cs);
  }
  return 0;
}