#include<bits/stdc++.h>

 using namespace std;

 const int maxn = ;

 int dp[maxn][maxn];

 bool check(string s,string t){

     int indx = ;

     for(int i = ;i<s.length();i++){

         if(t[indx] == s[i]) indx++;

     }

     if(indx == t.length()) return true;

     return false;

 }

 bool check(string s,string t1,string t2){

     memset(dp,-,sizeof(dp));

     dp[][] = ;

     for(int i = ;i<s.length();i++){

         for(int j = ;j<=t1.size();j++){

             if(dp[i][j]<) continue;

             if(j<t1.size() && s[i] == t1[j]){

                 dp[i+][j+] = max(dp[i+][j+],dp[i][j]);

             }

             if(dp[i][j]<t2.size() && s[i] == t2[dp[i][j]]){

                 dp[i+][j] = max(dp[i+][j],dp[i][j]+);

             }

             dp[i+][j] = max(dp[i+][j],dp[i][j]);

         }

     }

     if(dp[s.length()][t1.length()] == t2.length()) return true;

     return false;

 }

 void solve(){

     string s,t;

     cin>>s>>t;

     if(check(s,t)){

         cout<<"YES"<<endl;

         return;

     }

     for(int i = ;i<t.length()-;i++){

         string t1 = t.substr(,i+);

         string t2 = t.substr(i+,t.size());

         if(check(s,t1,t2)){

             cout<<"YES"<<endl;

             return;

         }

     }

     cout<<"NO"<<endl;

     return;

 }

 int main(){

     int t;

     cin>>t;

     while(t--){

         solve();

     }

     return ;

 }