def abbreviation(a, b):
    # Write your code here
    dp=[ [1]+ [0]*(len(b)) for i in range(len(a)+1)]
    # dp[i][0] always 1('YES') cuz b got 0 length
    
    for i in range(1,len(a)+1):
        for j in range(1,len(b)+1):
            if a[i-1]==b[j-1]:
                # same upper case
                dp[i][j]=dp[i-1][j-1]
            elif a[i-1]==b[j-1].lower():
                # same lower case
                dp[i][j]=max(dp[i-1][j-1], dp[i-1][j])
            elif a[i-1].isupper():
                dp[i][j]=0
            else:
                dp[i][j]=dp[i-1][j]

    if dp[len(a)][len(b)]:
        return 'YES'
    else:
        return 'NO'

string abbreviation(string a, string b) {
    vector<vector<bool>> M(a.size()+1, vector<bool>(b.size()+1));
    int upperCase = 0;
    M[0][0] = true;
    for (int i=1; i < a.size()+1; i++) {
        if (isupper(a[i-1])) upperCase++;
        if (upperCase == 0) M[i][0] = true;
    }
    for (int j=1; j < b.size()+1; j++) {
        for (int i=j; i < a.size()+1; i++) {
            if (M[i-1][j] == false or isupper(a[i-1])) M[i][j] = (M[i-1][j-1] and toupper(a[i-1]) == b[j-1]);
            else M[i][j] = true;
        }
    }
    return M[a.size()][b.size()] ? "YES" : "NO";
}

#include "bits/stdc++.h"
using namespace std;

constexpr bool is_upper(char c) { return c < 'a'; }
constexpr char upper(char c) { return is_upper(c) ? c : c-32; }

bool soln(std::string_view a, std::string_view b)
{
    using B = std::bitset<1001>;
    using A = std::array<B, 1001>;
    A cache;
    cache[0][0] = true;
    auto const asize = a.size(), bsize = b.size();
    for (auto x = 0; x < asize; ++x)
    {
        if (cache[x].none())
        {
            break;
        }
        for (auto y = 0; y < bsize+1; ++y)
        {
            if (!cache[x][y]) { continue; }
            cache[x+1][y+1] = cache[x+1][y+1] || (y < bsize && upper(a[x]) == b[y]);
            cache[x+1][y] = bool{cache[x+1][y]} || !is_upper(a[x]);
        }
        
    }
    return cache[asize][bsize];
}

int main() {
    int T;
    scanf("%d", &T);
    for(int ii = 0; ii < T; ++ ii) {
        string a, b;
        cin >> a >> b;
        
        puts(soln(a, b) ? "YES" : "NO");
    }
    return 0;
}

function abbreviation(a, b, i = a.length - 1, j = b.length - 1, dp = {}) {
    if (j < 0) return 'YES';
    if (i < 0) return 'NO';

    const k = `${i}-${j}`;
    if (!dp[k]) {
        const c1 = a[i];
        const c2 = b[j];
        const isCap = c1 < 'a';

        dp[k] = c1.toUpperCase() === c2
            && abbreviation(a, b, i - 1, j - 1, dp) === 'YES'
            ||
            !isCap
            && abbreviation(a, b, i - 1, j, dp) === 'YES'
            ? 'YES'
            : 'NO';
    }
    return dp[k];
}